# Number Of Substrings Containing All Three Characters: Walkthrough

Number Of Substrings Containing All Three Characters shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sliding window (or last-seen indices of a/b/c): once a window contains all three, every extension to the right is also valid.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (string DP, sliding window, trie, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Counting only the minimal windows and missing the longer ones that still contain a, b, and c.

## 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 the Linkjob AI app.