add 2300

Author: fishercoder1534

Diff for: paginated_contents/algorithms/3rd_thousand/README.md

@@ -80,6 +80,7 @@
 | 2315 | [Count Asterisks](https://leetcode.com/problems/count-asterisks/)                                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2315.java)                                       || Easy                                 ||
 | 2309 | [Greatest English Letter in Upper and Lower Case](https://leetcode.com/problems/greatest-english-letter-in-upper-and-lower-case/)                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2309.java)                                       || Easy                                 ||
 | 2303 | [Calculate Amount Paid in Taxes](https://leetcode.com/problems/calculate-amount-paid-in-taxes/)                                                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2303.java)                                       || Easy                                 ||
+| 2300 | [Successful Pairs of Spells and Potions](https://leetcode.com/problems/successful-pairs-of-spells-and-potions/)                                                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2300.java)                                       || Medium                               |Binary Search
 | 2299 | [Strong Password Checker II](https://leetcode.com/problems/strong-password-checker-ii/)                                                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2299.java)                                       || Easy                                 ||
 | 2293 | [Min Max Game](https://leetcode.com/problems/min-max-game/)                                                                                                                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2293.java)                                       || Easy                                 ||
 | 2288 | [Apply Discount to Prices](https://leetcode.com/problems/apply-discount-to-prices/)                                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2288.java)                                       || Medium                               ||

Diff for: src/main/java/com/fishercoder/solutions/thirdthousand/_2300.java

@@ -0,0 +1,34 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.Arrays;
+
+public class _2300 {
+    public static class Solution1 {
+        public int[] successfulPairs(int[] spells, int[] potions, long success) {
+            int[] result = new int[spells.length];
+            Arrays.sort(potions);
+            for (int i = 0; i < spells.length; i++) {
+                int j = binarySearch(potions, success, spells[i]);
+                result[i] = potions.length - j;
+            }
+            return result;
+        }
+
+        private int binarySearch(int[] potions, long success, int spell) {
+            int left = 0;
+            int right = potions.length - 1;
+            while (left < right) {
+                int mid = left + (right - left) / 2;
+                if ((long) potions[mid] * spell >= success) {
+                    right = mid;
+                } else {
+                    left = mid + 1;
+                }
+            }
+            if (left == right && left == potions.length - 1 && (long) spell * potions[left] < success) {
+                return potions.length;
+            }
+            return right;
+        }
+    }
+}

Diff for: src/test/java/com/fishercoder/thirdthousand/_2300Test.java

@@ -0,0 +1,32 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2300;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+
+public class _2300Test {
+    private static _2300.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2300.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertArrayEquals(new int[]{4, 0, 3}, solution1.successfulPairs(new int[]{5, 1, 3}, new int[]{1, 2, 3, 4, 5}, 7));
+    }
+
+    @Test
+    public void test2() {
+        assertArrayEquals(new int[]{2, 0, 2}, solution1.successfulPairs(new int[]{3, 1, 2}, new int[]{8, 5, 8}, 16));
+    }
+
+    @Test
+    public void test3() {
+        assertArrayEquals(new int[]{0, 0, 0, 1, 3, 3, 4}, solution1.successfulPairs(new int[]{1, 2, 3, 4, 5, 6, 7}, new int[]{1, 2, 3, 4, 5, 6, 7}, 25));
+    }
+
+}