Longest Subsequence With Limited Sum

Try to solve the Longest Subsequence With Limited Sum problem.

We'll cover the following

Statement

You are given an integer array, nums, of length n, and an integer array, queries, of length m.

For each element in queries, determine the maximum number of elements that can be selected from nums to form a subsequenceA subsequence is formed by removing zero or more elements from the array without changing the order of the remaining elements. such that the sum of the selected elements is less than or equal to the query value.

Return an array answer of length m, where answer[i] represents the size of the largest subsequence of nums whose sum is less than or equal to queries[i].

Constraints

  • n ==== nums.length

  • m ==== queries.length

  • 1≤1 \leq n, m ≤103\leq 10^3

  • 1≤1 \leq nums[i], queries[i] ≤105\leq 10^5

Examples

Press + to interact
canvasAnimation-image
1 of 4

Understand the problem

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

Longest Subsequence With Limited Sum

1

What is the output for the inputs given below?

nums = [1, 3, 4, 6, 15]

queries = [5, 10, 20]

A)

[2, 3, 4]

B)

[1, 2, 4]

C)

[2, 3, 5]

D)

[1, 2, 3]

Question 1 of 30 attempted

Figure it out!

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Drag and drop the cards to rearrange them in the correct sequence.

Try it yourself

Implement your solution in the following coding playground.

Press + to interact
Java
usercode > Solution.java
import java.util.*;



public class Solution{

    public static int[] answerQueries(int[] nums, int[] queries) {

        

        // Replace this placeholder return statement with your code

        return new int[]{};

    }

}
Longest Subsequence With Limited Sum

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.