Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Intersection of Two Arrays II
Bookmark
Brute Force
Hash Map
Sort + Two Pointers
Input
Standard
Multiple Matches
No Intersection
Custom
nums1
=
[1, 2, 2, 1]
,
nums2
=
[2, 2]
nums1
nums2
1
2
2
1
2
2
result
(empty)
no sorting — search nums2 for each value of nums1
nums1
nums2
1
2
2
1
2
2
result
(empty)
no sorting — search nums2 for each value of nums1
nums1
nums2
i
1
2
2
1
2
2
result
(empty)
look for
1
in nums2
nums1
nums2
≠
i
j
1
2
2
1
2
2
result
(empty)
nums2[0] =
2
≠ 1, keep scanning
nums1
nums2
i
1
2
2
1
2
2
result
(empty)
look for
2
in nums2
nums1
nums2
=
i
j
1
2
2
1
2
2
result
(empty)
2
found at nums2[0]
nums1
nums2
=
i
j
1
2
2
1
2
2
result
2
claim it, result +=
2
nums1
nums2
i
1
2
2
1
2
2
result
2
look for
2
in nums2
nums1
nums2
=
i
j
1
2
2
1
2
2
result
2
2
claim it, result +=
2
nums1
nums2
i
1
2
2
1
2
2
result
2
2
look for
1
in nums2
nums1
nums2
1
2
2
1
2
2
result
2
2
2
common values
algo
master
.
io
Step:
Search nums2 for each value of nums1, claiming one match at a time
0 / 11
Input
Standard
Multiple Matches
No Intersection
Custom
nums1
=
[1, 2, 2, 1]
,
nums2
=
[2, 2]
0 / 11
algo
master
.
io
Step:
Search nums2 for each value of nums1, claiming one match at a time
