# Longest Nice Substring: Interview Notes
Longest Nice Substring shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A string is nice when every letter that appears does so in both cases. Find the longest nice substring: divide-and-conquer on the first character that violates the rule (split there), or expand over all O(n^2) windows since n <= 100.
## 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) or O(n * 26).
## Common mistake
Checking only that the whole string contains both cases of some letter, or returning a subsequence.
## 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.