Leetcode 1913. Maximum Product Difference Between Two Pairs

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1913. Maximum Product Difference Between Two Pairs

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact