0
LearnHashing

Intersection of Two Arrays II

Read the lesson → understand the pattern → then code. Tutor works offline (built-in teacher); optional Cursor/Gemini keys upgrade chat quality.

Topic refresher: Hashing — Pay Space, Buy Time

Replace nested loops with unordered_map / unordered_set lookups.

unordered_map<int,int> mp;
for (int i = 0; i < n; i++) {
    int need = target - nums[i];
    if (mp.count(need)) return {mp[need], i};
    mp[nums[i]] = i;
}
Hashing

Intersection of Two Arrays II

Easy
LeetCode
2/8
EasyHashingLeetCode #350

Multiset Intersection

Count frequencies of one array; walk the other and consume counts.

Examples

Example 1

Input

4
1 2 2 1
2
2 2

Output

2 2
Example 2

Input

3
4 9 5
5
9 4 9 8 4

Output

4 9

Stuck? Take a nudge

C++17