# Shortest Completing Word: Walkthrough

Shortest Completing Word shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Count letters in the license plate (ignore digits and case). The shortest word whose counts cover the plate wins; ties keep the earliest word.

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

## Common mistake

Treating digits as letters or ignoring case incorrectly.

## 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 the Linkjob AI app.