Unstub

Counting with a hash mapEasy

Intersection of Two Arrays II

Return the numbers that nums1 and nums2 have in common, each as many times as it is in both, in any order.

Aim for O(n + m) time, O(n) spaceInspired by a classic interview problem ↗