# Unique Substrings In Wraparound String: Explained

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

## Key idea

s is a substring of the infinite wraparound alphabet. The number of unique substrings of s that also appear in that wraparound string equals, for each ending letter, the longest wraparound run ending there; sum those 26 maxima.

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

Inserting every substring into a set (too many, and most are not wraparound).

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