Available question text
Given an array nums, choose four distinct elements to maximize the product difference (a*b - c*d). The core challenge is recognizing that the optimal choice is the two largest numbers for the first product and the two smallest for the second, so you can solve by identifying those top-two and bottom-two values.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1913. Maximum Product Difference Between Two Pairs
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source