# Count Common Words With One Occurrence (LeetCode 2085) Words appearing once in both arrays. ## Approach ```python from collections import Counter def countWords(words1, words2): c1, c2 = Counter(words1), Counter(words2) return sum(1 for w,c in c1.items() if c==1 and c2[w]==1) ``` ## Complexity - Time / space depend on the scan above; keep the solution linear when possible. ## Interview tip Narrate the invariant before coding. I drill these patterns with [Linkjob AI](https://www.linkjob.ai/) ahead of OA rounds. *Disclosure: I work on Linkjob AI, an interview copilot. The algorithm above stands on its own.*