# Divide Intervals Into Minimum Number Of Groups: Explained
Divide Intervals Into Minimum Number Of Groups shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
The answer is the maximum number of intervals overlapping any point (same as meeting rooms). Sweep +1 at each start and -1 just after each end; the peak of the running sum is the number of groups.
## 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
Assigning groups greedily without a free-group heap or a sweep, which can open extra groups.
## 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.