# Find The Shortest Superstring: Interview Notes

Find The Shortest Superstring shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

n <= 12 strings. Precompute overlap[i][j] = longest suffix of i that is a prefix of j. Held-Karp DP: dp[mask][last] is the shortest superstring assembling mask and ending at last. Reconstruct the path.

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

## Common mistake

Greedy always appending the max-overlap unused string, which is only an approximation.

## 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 undetectable AI interview copilot.