# String Compression II: Practice Notes

String Compression II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

DP over (index, last char, last-char run length, deletions left). Transitions: delete s[i], or append it (which may increase the run encoding length at 1, 9, 99).

## 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 * k).

## Common mistake

Forgetting that the encoding length jumps at run lengths 10 and 100.

## 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 AI interview helper that uses your resume.