Longest Subsequence With Limited Sum

EasyBinary Searchbinary search

Solve this the way you would in the interview: out loud, on a timer, with an AI interviewer asking follow-ups while you code. You get a scored report at the end.

Practice this as a mock interviewFree to start, no account needed

Problem

You are given an integer array nums of length n and an integer array queries of length m. For each queries[j], find the maximum number of elements you can pick from nums (any positions, order does not matter) such that their sum is at most queries[j]. Return an array answer of length m where answer[j] is that maximum size. Target O((n + m) log n) time.

Examples

Input: nums = [4,5,2,1], queries = [3,10,21]
Output: [2,3,4]
Sum <= 3: pick [2,1]. Sum <= 10: pick [4,5,1]. Sum <= 21: take everything (12).
Input: nums = [2,3,4,5], queries = [1]
Output: [0]
Every element exceeds 1, so nothing can be picked.

Constraints

  • n == nums.length, m == queries.length
  • 1 <= n, m <= 1000
  • 1 <= nums[i], queries[j] <= 10^6

What the interviewer grades

A correct solution is one of five scores. The report also grades problem understanding (did you clarify inputs and edge cases before coding), problem solving, communication while you work, code quality, and testing. See a sample report, or read up on the pattern in the lessons.

More binary search problems