Skip to content

problem6.md

Latest commit

 

History

History
11 lines (8 loc) · 392 Bytes

problem6.md

File metadata and controls

11 lines (8 loc) · 392 Bytes

Problem 6: Unique Intersection (Intersection of Two Arrays)

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.

Input Format

  • Two integer arrays nums1 and nums2.

Example

Input: nums1 = [1, 2, 2, 1], nums2 = [2, 2]
Output: [2]