# Find Common Elements Between Two Arrays: Study Guide
Find Common Elements Between Two Arrays shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Count how many elements of nums1 appear in nums2, plus how many of nums2 appear in nums1 (occurrence-wise, not unique). Put each array into a set and count members of the other array that sit in that set.
## 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+m).
## Common mistake
Intersecting the two sets and returning the intersection size once, which undercounts because the answer is a sum of two directed counts.
## 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 interview answers in real time.