LeetCode 1913: Maximum Product Difference Between Two Pairs Solution

Master LeetCode problem 1913 (Maximum Product Difference Between Two Pairs), a easy challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

1913. Maximum Product Difference Between Two Pairs

Easy

Array Sorting

Problem Explanation

Explanation

To maximize the product difference between two pairs, we need to select two pairs of numbers that have the largest difference in their products. We can achieve this by sorting the input array. By sorting the array in ascending order, we ensure that the largest numbers are at the end and the smallest numbers are at the beginning. Then, we can calculate the product difference by taking the product of the last two numbers and the product of the first two numbers.

Algorithm

Sort the input array nums in ascending order.
Calculate the product difference by taking the product of the last two numbers and the product of the first two numbers.
Return the maximum product difference calculated.

Time Complexity

The time complexity of this algorithm is O(n log n) due to the sorting step.

Space Complexity

The space complexity of this algorithm is O(1) as we are not using any extra space other than a few variables.

Solution Code

import java.util.Arrays;

class Solution {
    public int maxProductDifference(int[] nums) {
        Arrays.sort(nums);
        int n = nums.length;
        return (nums[n - 1] * nums[n - 2]) - (nums[0] * nums[1]);
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1913 (Maximum Product Difference Between Two Pairs)?

This page provides optimized solutions for LeetCode problem 1913 (Maximum Product Difference Between Two Pairs) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 1913 (Maximum Product Difference Between Two Pairs)?

The time complexity for LeetCode 1913 (Maximum Product Difference Between Two Pairs) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1913 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1913 in Java, C++, or Python.

Back to LeetCode Solutions