# Maximum Number Of Events That Can Be Attended II: Interview Notes

Maximum Number Of Events That Can Be Attended II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sort events by start (or end). DP[i][k] is the best value using events i.. and at most k picks. Binary-search the next event whose start is >= current end so you either skip i or take its value plus DP[next][k-1].

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) 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 k log n).

## Common mistake

A greedy take-earliest scan, which is optimal only for the k=unbounded / value=1 variant.

## 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 linkjob.ai.