sksaini908
diff --git a/‎README.md
Lines changed: 1 addition & 0 deletions b/‎README.md
Lines changed: 1 addition & 0 deletions
diff --git a/‎src/main/java/com/fishercoder/solutions/_1862.java
Lines changed: 27 additions & 0 deletions b/‎src/main/java/com/fishercoder/solutions/_1862.java
Lines changed: 27 additions & 0 deletions
diff --git a/‎src/test/java/com/fishercoder/_1862Test.java
Lines changed: 32 additions & 0 deletions b/‎src/test/java/com/fishercoder/_1862Test.java
Lines changed: 32 additions & 0 deletions
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      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|
 
@@ -0,0 +1,27 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.List;
+import java.util.TreeMap;
+
+public class _1862 {
+    public static class Solution1 {
+        /**TODO: this results in TLE, fix it.*/
+        public int sumOfFlooredPairs(int[] nums) {
+            TreeMap<Integer, Integer> map = new TreeMap<>();
+            for (int num : nums) {
+                map.put(num, map.getOrDefault(num, 0) + 1);
+            }
+            List<Integer> list = new ArrayList<>(map.keySet());
+            int mod = 1000000007;
+            long sum = 0l;
+            for (int i = list.size() - 1; i >= 0; i--) {
+                for (int j = 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;
+        }
+    }
+}
@@ -0,0 +1,32 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1862;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1862Test {
+    private static _1862.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1862.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(49, solution1.sumOfFlooredPairs(new int[]{7, 7, 7, 7, 7, 7, 7}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(10, solution1.sumOfFlooredPairs(new int[]{2, 5, 9}));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(17, solution1.sumOfFlooredPairs(new int[]{4, 3, 4, 3, 5}));
+    }
+
+}