# Reverse Substrings Between Each Pair Of Parentheses: Interview Notes
Reverse Substrings Between Each Pair Of Parentheses shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A stack of strings: on "(", push a new empty buffer; on a letter, append to the current buffer; on ")", reverse the current buffer and append it to the previous one. The last remaining buffer is the answer. Equivalently, jump between matching parens and reverse direction.
## 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
Reversing the entire string on every pair (which can mis-nest) or forgetting inner pairs are reversed first.
## 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 interview assistant.