# Distinct Echo Substrings: Interview Notes
Distinct Echo Substrings shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
An echo is a substring that is some string concatenated with itself. For each even length 2L, a rolling hash (or Z-algorithm on suffixes) finds positions i where s[i:i+L] == s[i+L:i+2L]; store the distinct such substrings in a hash set.
## 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^2) worst-case, faster with hashing.
## Common mistake
Generating every substring and checking equality with its two halves naively without hashing, which is too slow on long strings.
## 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.