_2389. Longest Subsequence With Limited Sum.md

2389. Longest Subsequence With Limited Sum

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : June 01, 2024

Last updated : July 01, 2024

---

Related Topics : Array, Binary Search, Greedy, Sorting, Prefix Sum

Acceptance Rate : 71.85 %

---

Solutions

• e2389.py

Python

e2389.py

class Solution:
    def answerQueries(self, nums: List[int], queries: List[int]) -> List[int]:
        nums = sorted(nums) 

        for i in range(1, len(nums)) :
            nums[i] += nums[i - 1]
        
        return [bisect_right(nums, i) for i in queries]