| # | Title | Solutions | Video | Difficulty | Tag

|-----|----------------|---------------|--------|-------------|-------------

|1913|[Maximum Product Difference Between Two Pairs](https://leetcode.com/problems/maximum-product-difference-between-two-pairs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1913.java)||Easy|Sort|

|1910|[Remove All Occurrences of a Substring](https://leetcode.com/problems/remove-all-occurrences-of-a-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1904.java)||Medium|String|

|1909|[Remove One Element to Make the Array Strictly Increasing](https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1909.java)||Easy|Array|

|1904|[The Number of Full Rounds You Have Played](https://leetcode.com/problems/the-number-of-full-rounds-you-have-played/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1904.java)||Medium|String, Greedy|

packagecom.fishercoder.solutions;

importjava.util.Arrays;

publicclass_1913 {

publicstaticclassSolution1 {

publicintmaxProductDifference(int[]nums) {

Arrays.sort(nums);

intlen =nums.length;

returnnums[len -1] *nums[len -2] -nums[0] *nums[1];

}

}

}