|1880|[Check if Word Equals Summation of Two Words](https://leetcode.com/problems/check-if-word-equals-summation-of-two-words/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1880.java)||Easy|String|

|1877|[Minimize Maximum Pair Sum in Array](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1877.java)||Medium|Greedy, Sort|

|1876|[Substrings of Size Three with Distinct Characters](https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1876.java)||Easy|String|

|1874|[Minimize Product Sum of Two Arrays](https://leetcode.com/problems/minimize-product-sum-of-two-arrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1874.java)||Medium|Array, Greedy, Sorting|

|1869|[Longer Contiguous Segments of Ones than Zeros](https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1869.java)||Easy|Array, Two Pointers|

|1863|[Sum of All Subset XOR Totals](https://leetcode.com/problems/sum-of-all-subset-xor-totals/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1863.java)||Easy|Backtracking, Recursion|

|1862|[Sum of Floored Pairs](https://leetcode.com/problems/sum-of-floored-pairs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1862.java)||Hard|Math|

packagecom.fishercoder.solutions;

importjava.util.Arrays;

publicclass_1874 {

publicstaticclassSolution1 {

publicintminProductSum(int[]nums1,int[]nums2) {

Arrays.sort(nums1);

Arrays.sort(nums2);

intans =0;

for (inti =0,j =nums1.length -1;i <nums1.length &&j >=0;i++,j--) {

ans +=nums1[i] *nums2[j];

}

returnans;

}

}

}