|1588|[Sum of All Odd Length Subarrays](https://leetcode.com/problems/sum-of-all-odd-length-subarrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1588.java)||Easy|Array|

|1583|[Count Unhappy Friends](https://leetcode.com/problems/count-unhappy-friends/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1583.java)||Medium|Array|

|1582|[Special Positions in a Binary Matrix](https://leetcode.com/problems/special-positions-in-a-binary-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1582.java)||Easy|Array|

|1577|[Number of Ways Where Square of Number Is Equal to Product of Two Numbers](https://leetcode.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1577.java)||Medium|HashTable, Math|

|1576|[Replace All ?'s to Avoid Consecutive Repeating Characters](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1576.java)|[:tv:](https://youtu.be/SJBDLYqrIsM)|Easy|String|

|1574|[Shortest Subarray to be Removed to Make Array Sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1574.java)||Medium|Array, Binary Search|

|1572|[Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1572.java)||Easy|Array|

packagecom.fishercoder.solutions;

importjava.util.HashMap;

importjava.util.Map;

publicclass_1577 {

publicstaticclassSolution1 {

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

longresult =0;

for (longnum :nums1) {

result +=twoProduct(num *num,nums2);

}

for (longnum :nums2) {

result +=twoProduct(num *num,nums1);

}

return (int)result;

}

privatelongtwoProduct(longproduct,int[]nums) {

Map<Long,Long>map =newHashMap<>();

longcount =0;

for (longnum :nums) {

if (product %num ==0) {

count +=map.getOrDefault(product /num,0l);

}

map.put(num,map.getOrDefault(num,0l) +1);

}

returncount;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1577;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertEquals;

publicclass_1577Test {

privatestatic_1577.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_1577.Solution1();

}

publicvoidtest1() {

assertEquals(1,solution1.numTriplets(newint[]{7,4},newint[]{5,2,8,9}));

}

publicvoidtest2() {

assertEquals(9,solution1.numTriplets(newint[]{1,1},newint[]{1,1,1}));

}

publicvoidtest3() {

assertEquals(2,solution1.numTriplets(newint[]{7,7,8,3},newint[]{1,2,9,7}));

}

publicvoidtest4() {

assertEquals(0,solution1.numTriplets(newint[]{4,7,9,11,23},newint[]{3,5,1024,12,18}));

}

publicvoidtest5() {

assertEquals(4,solution1.numTriplets(newint[]{3,1,2,2},newint[]{1,3,4,4}));

}

publicvoidtest6() {

assertEquals(5,solution1.numTriplets(newint[]{4,1,4,1,12},newint[]{3,2,5,4}));

}

publicvoidtest7() {

assertEquals(234,solution1.numTriplets(newint[]{14,1,1,12,7,12,10,4,11,10,5,2,5,14,7,9,10,13,15,6,9,12,6,12,4,10,9,12,11},newint[]{3,12,1,9,1,12,4,12,4,1,7,10,7,11,4,13,4,11,5,1,14,12,15,4,2,3,13,10,3,4}));

}

}