Maximum Number of Integers to Choose From a Range I

You are given an integer array banned and two integers n and maxSum. You are choosing some number of integers following the below rules:

  • The chosen integers have to be in the range [1, n].
  • Each integer can be chosen at most once.
  • The chosen integers should not be in the array banned.
  • The sum of the chosen integers should not exceed maxSum.

Return the maximum number of integers you can choose following the mentioned rules.

Example 1
Inputbanned = [1,6,5], n = 5, maxSum = 6
Output2
You can choose the integers 2 and 4; they are from the range [1, 5], both do not appear in banned, and their sum is 6, which does not exceed maxSum.
Example 2
Inputbanned = [1,2,3,4,5,6,7], n = 8, maxSum = 1
Output0
You cannot choose any integer while following the mentioned conditions.

Constraints

  • 1 <= banned.length <= 10^4
  • 1 <= banned[i], n <= 10^4
  • 1 <= maxSum <= 10^9

Asked at 3 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate