# Maximum Number Of Integers To Choose From A Range I: Practice Notes

Maximum Number Of Integers To Choose From A Range I shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Choose distinct integers in [1,n] excluding banned, summing to at most maxSum; maximize how many you pick. Greedily take the smallest allowed integers until the next one would exceed maxSum.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n or |banned| log).

## Common mistake

Taking the largest integers first, which wastes budget, or forgetting to skip banned values.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at real-time interview help.