2022-08-30 update: added "Longest Subsequence With Limited Sum" (#77)

Author: fartem

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/LongestSubsequenceWithLimitedSum.java

@@ -0,0 +1,36 @@
+package com.smlnskgmail.jaman.leetcodejava.easy;
+
+import java.util.Arrays;
+
+public class LongestSubsequenceWithLimitedSum {
+
+    private final int[] nums;
+    private final int[] queries;
+
+    public LongestSubsequenceWithLimitedSum(int[] nums, int[] queries) {
+        this.nums = nums;
+        this.queries = queries;
+    }
+
+    public int[] solution() {
+        int[] result = new int[queries.length];
+        Arrays.sort(nums);
+        for (int i = 0; i < queries.length; i++) {
+            int sum = 0;
+            int j;
+            for (j = 0; j < nums.length; j++) {
+                int num = nums[j];
+                if (sum + num > queries[i]) {
+                    result[i] = j;
+                    break;
+                }
+                sum += num;
+            }
+            if (j == nums.length) {
+                result[i] = j;
+            }
+        }
+        return result;
+    }
+
+}

src/test/java/com/smlnskgmail/jaman/leetcodejava/easy/LongestSubsequenceWithLimitedSumTest.java

@@ -0,0 +1,20 @@
+package com.smlnskgmail.jaman.leetcodejava.easy;
+
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class LongestSubsequenceWithLimitedSumTest {
+
+    @Test
+    public void defaultTest() {
+        assertArrayEquals(
+                new int[]{2, 3, 4},
+                new LongestSubsequenceWithLimitedSum(
+                        new int[]{4, 5, 2, 1},
+                        new int[]{3, 10, 21}
+                ).solution()
+        );
+    }
+
+}