# Find Latest Group Of Size M: Explained
Find Latest Group Of Size M shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Binary string starts at all zeros; day i flips position arr[i-1] to 1. Return the latest day a contiguous group of 1s has length exactly m, or -1. Union neighboring 1-groups as bits appear and track counts of each group length (or the endpoints of each run).
## 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).
## Common mistake
Resimulating the whole string every day (O(n^2)), or returning the first day instead of the latest.
## 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 www.linkjob.ai.