# Find Maximum Number Of String Pairs: Walkthrough
Find Maximum Number Of String Pairs shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Words are distinct; a pair is two words that are reverses of each other. Put seen reversed-words in a set; for each word, if its reverse is already seen, count a pair, else add the word. Since words are unique and length 2 in the easy version, a frequency map on the canonical min(w, reverse(w)) also works.
## 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
Pairing a word with itself when it is a palindrome (the problem usually forbids that unless two copies exist).
## 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.