# Count Binary Substrings: Interview Notes

Count Binary Substrings shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Count substrings that contain an equal number of 0s and 1s, with all 0s and all 1s grouped together (like 0011, 01, 1100). Group runs of identical bits; between two adjacent runs of lengths a,b you contribute min(a,b).

## 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 every even-length balanced substring (001100 has inner 0110 which is not grouped).

## 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 copilot.