Intersection of Two Arrays - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
349. Intersection of Two Arrays
Easy
10 Points
Array
Hash Table
Two Pointers
Binary Search
Sorting
Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any order.
Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [9,4]
Explanation: [4,9] is also accepted.
Constraints
1 <= nums1.length, nums2.length <= 1000
0 <= nums1[i], nums2[i] <= 1000
349. Intersection of Two Arrays
Easy
10 Points
Array
Hash Table
Two Pointers
Binary Search
Sorting
Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any order.