# Unique Letter String: Practice Notes

Unique Letter String shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sum, over every substring, how many characters appear exactly once in it. For each occurrence of a letter, the count of substrings where that occurrence is the unique one is (left gap) * (right gap).

## 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 unique letters 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 AI interview helper that uses your resume.