Leetcode Problem 350. Intersection of Two Arrays II

350. Intersection of Two Arrays II

Leetcode Solutions

Initialize an empty hash map m.
Iterate over nums1, incrementing the count for each number in m.
Initialize an empty list result to store the intersection.
Iterate over nums2, and for each number: a. If the number is in m with a count greater than 0, append it to result and decrement the count in m.
Return the result list.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen