# Max Consecutive Ones: Explained
Max Consecutive Ones shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Longest run of 1s in a binary array. Scan, reset the streak on a 0, track the max.
## 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
Counting the total number of 1s instead of the longest contiguous run, or forgetting to update the max after the loop ends.
## 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 AI tool for job interviews.