solves maximum product difference between two pairs

Author: anishLearnsToCode

README.md

@@ -460,7 +460,7 @@
 | 1897 | [Redistribute Characters to Make All Strings Equal](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal)                      |                                                   [![Java](assets/java.png)](src/RedistributeCharactersToMakeAllStringsEqual.java)                                                   |                                                                                                                                   |
 | 1903 | [Largest Odd Number in String](https://leetcode.com/problems/largest-odd-number-in-string)                                                                |                                                            [![Java](assets/java.png)](src/LargestOddNumberInString.java)                                                             |                                                                                                                                   |
 | 1909 | [Remove One Element to Make the Array Strictly Increasing](https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing)        |                                                [![Java](assets/java.png)](src/RemoveOneElementToMakeTheArrayStrictlyIncreasing.java)                                                 |                                                                                                                                   |
-| 1913 | [Maximum Product Difference Between Two Pairs](https://leetcode.com/problems/maximum-product-difference-between-two-pairs)                                |                                                                                                                                                                                      |                                                                                                                                   |
+| 1913 | [Maximum Product Difference Between Two Pairs](https://leetcode.com/problems/maximum-product-difference-between-two-pairs)                                |                                                     [![Java](assets/java.png)](src/MaximumProductDifferenceBetweenTwoPairs.java)                                                     |                                                                                                                                   |
 | 1920 | [Build Array from Permutation](https://leetcode.com/problems/build-array-from-permutation)                                                                |                                                                                                                                                                                      |                                                                                                                                   |
 | 1925 | [Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples)                                                                        |                                                                                                                                                                                      |                                                                                                                                   |
 | 1929 | [Concatenation of Array](https://leetcode.com/problems/concatenation-of-array)                                                                            |                                                                                                                                                                                      |                                                                                                                                   |

src/MaximumProductDifferenceBetweenTwoPairs.java

@@ -0,0 +1,49 @@
+// https://leetcode.com/problems/maximum-product-difference-between-two-pairs
+// T: O(N)
+// S: O(1)
+
+public class MaximumProductDifferenceBetweenTwoPairs {
+    public int maxProductDifference(int[] nums) {
+        Pair largest = getLargestAndSecondLargest(nums);
+        Pair smallest = getSmallestAndSecondSmallest(nums);
+        return largest.a * largest.b - smallest.a * smallest.b;
+    }
+
+    private Pair getLargestAndSecondLargest(int[] array) {
+        int largest = Integer.MIN_VALUE, secondLargest = Integer.MIN_VALUE;
+        for (int element : array) {
+            if (element > largest) {
+                int temp = largest;
+                largest = element;
+                secondLargest = temp;
+            } else if (element > secondLargest) {
+                secondLargest= element;
+            }
+        }
+        return new Pair(largest, secondLargest);
+    }
+
+    private Pair getSmallestAndSecondSmallest(int[] array) {
+        int smallest = Integer.MAX_VALUE, secondSmallest = Integer.MAX_VALUE;
+        for (int element : array) {
+            if (element < smallest) {
+                int temp = smallest;
+                smallest = element;
+                secondSmallest = temp;
+            } else if (element < secondSmallest) {
+                secondSmallest = element;
+            }
+        }
+        return new Pair(smallest, secondSmallest);
+    }
+
+    private static final class Pair {
+        private final int a;
+        private final int b;
+
+        private Pair(int a, int b) {
+            this.a = a;
+            this.b = b;
+        }
+    }
+}