You are given an integer array banned and two integers n and maxSum.

You want to choose the maximum number of integers such that:

• Every chosen integer is in the range $[1, n]$.

• Each integer is chosen at most once.

• None of the chosen integers appear in banned.

• The total sum of the chosen integers does not exceed maxSum.

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

Constraints:

• $1 \leq$ banned.length $\leq 10^5$

• $1 \leq$ banned[i] $\leq$ n $\leq 10^9$

• $1 \leq$ maxSum $\leq 10^{15}$

Now, 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:

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

Implement your solution in the following coding playground.