# Sentence Similarity II: Explained
Sentence Similarity II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Union-Find every similar-word pair (undirected, transitive). The two sentences are similar when they have the same length and each corresponding pair of words is equal or shares a parent.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) 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(P α(P) + N).
## Common mistake
Only checking the given pairs and missing a transitive chain a~b, b~c that should make a similar to c.
## 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 AI job search and interview copilot.