Practice Intersection of Two Arrays
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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.
Source: Intersection of Two Arrays on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums1 = [1,2,2,1], nums2 = [2,2]
Output
[2]
# Example 2
Input
nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output
[9,4]
Constraints
1 <= nums1.length, nums2.length <= 1000
0 <= nums1[i], nums2[i] <= 1000
Related LeetCode Problems
Practice more problems similar to Intersection of Two Arrays.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.