# Encode String With Shortest Length: Explained

Encode String With Shortest Length shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

DP[i][j] = shortest encoding of s[i:j]. Candidates: the raw substring, a concat DP[i][k]+DP[k][j], or a repeat k[encoded_token] when the slice is token repeated k times. Fill by increasing length.

## 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^3).

## Common mistake

Always collapsing the whole string into one repeat (not always shortest) or forgetting you may encode the token itself recursively.

## 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 here.