add 2389

Author: fishercoder1534

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

@@ -58,6 +58,7 @@
 | 2404 | [Most Frequent Even Element](https://leetcode.com/problems/most-frequent-even-element/)                                                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2404.java)                                       || Easy                                 ||
 | 2399 | [Check Distances Between Same Letters](https://leetcode.com/problems/check-distances-between-same-letters/)                                                                                  | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2399.java)                                       || Medium                               ||
 | 2395 | [Find Subarrays With Equal Sum](https://leetcode.com/problems/find-subarrays-with-equal-sum/)                                                                                                | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2395.java)                                       || Easy                                 ||
+| 2389 | [Longest Subsequence With Limited Sum](https://leetcode.com/problems/longest-subsequence-with-limited-sum/)                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2389.java)                                       || Easy                                 | 
 | 2385 | [Amount of Time for Binary Tree to Be Infected](https://leetcode.com/problems/amount-of-time-for-binary-tree-to-be-infected/)                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2380.java)                                       || Medium                               | BFS                       
 | 2380 | [Time Needed to Rearrange a Binary String](https://leetcode.com/problems/time-needed-to-rearrange-a-binary-string/)                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2380.java)                                       || Medium                               ||
 | 2379 | [Minimum Recolors to Get K Consecutive Black Blocks](https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks/)                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2379.java)                                       || Easy                                 ||

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

@@ -0,0 +1,43 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.Map;
+import java.util.TreeMap;
+
+public class _2389 {
+    public static class Solution1 {
+        /**
+         * My completely original solution, not sure why it's labeled EASY, IMHO, it should be a soft MEDIUM.
+         */
+        public int[] answerQueries(int[] nums, int[] queries) {
+            TreeMap<Integer, Integer> map = new TreeMap<>();
+            int total = 0;
+            for (int num : nums) {
+                map.put(num, map.getOrDefault(num, 0) + 1);
+                total += num;
+            }
+            int[] answer = new int[queries.length];
+            for (int i = 0; i < queries.length; i++) {
+                int sum = total;
+                int len = nums.length;
+                TreeMap<Integer, Integer> copy = new TreeMap<>(map);
+                if (sum <= queries[i]) {
+                    answer[i] = len;
+                } else {
+                    do {
+                        sum -= copy.lastKey();
+                        len--;
+                        if (sum <= queries[i]) {
+                            answer[i] = len;
+                            break;
+                        }
+                        Map.Entry<Integer, Integer> lastEntry = copy.pollLastEntry();
+                        if (lastEntry.getValue() > 1) {
+                            copy.put(lastEntry.getKey(), lastEntry.getValue() - 1);
+                        }
+                    } while (sum > queries[i]);
+                }
+            }
+            return answer;
+        }
+    }
+}

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

@@ -0,0 +1,21 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2389;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+
+public class _2389Test {
+    private static _2389.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2389.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertArrayEquals(new int[]{2, 3, 4}, solution1.answerQueries(new int[]{4, 5, 2, 1}, new int[]{3, 10, 21}));
+    }
+}