# Extra Characters In A String: Explained

Extra Characters In A String shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

DP[i] = min extra chars to encode s[:i]. For each end i, either throw away s[i-1] (dp[i-1]+1) or, if s[j:i] is in the dictionary, take dp[j]. A Trie of the dictionary speeds up the inner lookup.

## 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 + dict).

## Common mistake

A greedy left-to-right match that commits to the first dictionary word and can leave more leftovers than an optimal later cut.

## 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 tool for job interviews.