# Maximum Deletions On A String: Interview Notes
Maximum Deletions On A String shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
You may delete a non-empty prefix that is also a prefix of the remaining string (i.e. s has a prefix that is repeated immediately). Maximize the number of operations to delete the whole string (last op can always delete whatever is left). DP: dp[i] = max operations to finish s[i:]; try every even-length doubled prefix starting at i (rolling hash or string compare) and take 1 + dp[i+len]. Always dp[i] >= 1.
## 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).
## Common mistake
Allowing a prefix that matches a later non-adjacent copy instead of the immediately following substring, or forgetting that the final leftover always costs one deletion.
## 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.