# Sentence Similarity III: Explained
Sentence Similarity III shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Two sentences are similar if one can be obtained by inserting one sentence into the other. Match the longest shared prefix and suffix words; the leftovers must sit in a single gap.
## 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).
## Common mistake
Allowing leftovers on both ends instead of one contiguous insertion.
## 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 www.linkjob.ai.