# Count Unique Characters Of All Substrings Of A Given String: Walkthrough

Count Unique Characters Of All Substrings Of A Given String shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

For each occurrence of a character, the number of substrings where it is unique is (left gap to the previous same letter) * (right gap to the next). Sum over every occurrence.

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

Recounting uniqueness inside every substring.

## 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 try it free.