Intersection of Two Arrays II Problem

Intersection of Two Arrays II Problem — ExecCode Easy DSA Practice

Solve the Intersection of Two Arrays II problem on ExecCode. Free online easy DSA practice in Hashing. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given two integer arrays nums1 and nums2, return an array of their intersection. Your task is to 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.

Examples

Input {"nums1": [1, 2, 2, 1], "nums2": [2, 2]}; Output [2, 2]. Input {"nums1": [4, 9, 5], "nums2": [9, 4, 9, 8, 4]}; Output [4, 9]. Input {"nums1": [1], "nums2": [1]}; Output 1

Constraints

1 <= nums1.length, nums2.length <= 1000 0 <= nums1[i], nums2[i] <= 1000

Practice Intersection of Two Arrays II free on ExecCode. Browse DSA problems, topic map, and placement guides.