# Shortest Way To Form String: Interview Notes
Shortest Way To Form String shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Greedy: for each unused suffix of target, find the longest prefix that is a subsequence of source (two pointers, or binary search on next-occurrence). Count how many such passes you need.
## 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(|source| * |target|).
## Common mistake
Requiring a contiguous substring instead of a subsequence.
## 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 this tool.