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.