Skip to content

problem11.md

Latest commit

 

History

History
11 lines (8 loc) · 443 Bytes

problem11.md

File metadata and controls

11 lines (8 loc) · 443 Bytes

Problem 11: Dual-Pointer Intersection (Intersection of Two Arrays II)

Problem Statement

Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in both arrays 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, 2]