# Intersection Of Two Arrays II: Interview Notes

Intersection Of Two Arrays II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Same but this time keep multiplicity (min count of each value). Hash-map the smaller array's counts and decrement on matches, or sort and two-pointer without skipping duplicates beyond the min count.

## 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

Using a set intersection, which drops multiplicity.

## 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 undetectable AI interview copilot.