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

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

|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|

|1861|[Rotating the Box](https://leetcode.com/problems/rotating-the-box/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1861.java)||Medium|Array, Two Pointers|

|1860|[Incremental Memory Leak](https://leetcode.com/problems/incremental-memory-leak/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1860.java)||Medium|Math|

|1859|[Sorting the Sentence](https://leetcode.com/problems/sorting-the-sentence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1859.java)||Easy|String, Sort|

packagecom.fishercoder.solutions;

importjava.util.ArrayList;

importjava.util.List;

importjava.util.TreeMap;

publicclass_1862 {

publicstaticclassSolution1 {

publicintsumOfFlooredPairs(int[]nums) {

TreeMap<Integer,Integer>map =newTreeMap<>();

for (intnum :nums) {

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

}

List<Integer>list =newArrayList<>(map.keySet());

intmod =1000000007;

longsum =0l;

for (inti =list.size() -1;i >=0;i--) {

for (intj =i;j >=0;j--) {

sum += (list.get(i) /list.get(j)) *map.get(list.get(j)) *map.get(list.get(i));

sum %=mod;

}

}

return (int)sum;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1862;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertEquals;

publicclass_1862Test {

privatestatic_1862.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_1862.Solution1();

}

publicvoidtest1() {

assertEquals(49,solution1.sumOfFlooredPairs(newint[]{7,7,7,7,7,7,7}));

}

publicvoidtest2() {

assertEquals(10,solution1.sumOfFlooredPairs(newint[]{2,5,9}));

}

publicvoidtest3() {

assertEquals(17,solution1.sumOfFlooredPairs(newint[]{4,3,4,3,5}));

}

}