[LeetCode] 2389. Longest Subsequence With Limited Sum
You are given an integer array nums of length n, and an integer array queries of length m. Return an array answer of length m where answer[i] is the maximum size of a subsequence that you can take fro