# IPO: Practice Notes
IPO shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Split projects into a min-heap keyed by required capital (locked) and a max-heap of profits among those you can currently afford. Each of k rounds unlocks newly affordable projects and then takes the best profit, adding it to capital.
## 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 log n).
## Common mistake
Always taking the cheapest project, which can leave a much larger profit on the table.
## 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.