# Shortest Common Supersequence: Walkthrough
Shortest Common Supersequence shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
SCS length is n+m-LCS. Reconstruct by walking an LCS DP table: when characters match, take that char once and move diagonally; otherwise step toward the larger DP neighbor and emit that string’s char. Finish leftover prefixes.
## 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(nm).
## Common mistake
Concatenating s+t and calling it a supersequence (valid but not shortest) or emitting both copies of an LCS character.
## 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 try it free.