Maximum Product Difference Between Two Pairs

The product difference between two pairs (a, b) and (c, d) is defined as (a * b) - (c * d).

• For example, the product difference between (5, 6) and (2, 7) is (5 * 6) - (2 * 7) = 16.

Given an integer array nums, choose four distinct indices w, x, y, and z such that the product difference between pairs (nums[w], nums[x]) and (nums[y], nums[z]) is maximized.

Return the maximum such product difference.

LeetCode Problem - 1913

import java.util.Arrays;

class Solution {
    public int maxProductDifference(int[] nums) {
        // Sort the array to easily find the maximum and minimum elements
        Arrays.sort(nums);

        // Calculate the maximum product difference between the largest and second largest elements,
        // and the smallest and second smallest elements
        return (nums[nums.length - 1] * nums[nums.length - 2]) - (nums[0] * nums[1]);
    }
}