Intersection of Two Arrays

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 Format

nums1 = [list of integers], nums2 = [list of integers]

Output Format

int[] (unique common elements in any order)

Constraints

  • 1 <= nums1.length, nums2.length <= 1000; -1000 <= nums1[i], nums2[j] <= 1000

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:

[4,9]

Example 3:

Input:

nums1 = [1,2]
nums2 = [1,1]

Output:

[1]

Example 4:

Input:

nums1 = [1]
nums2 = [1]

Output:

[1]
Loading...
Intersection of Two Arrays - Hashing DSA Problem