Leetcode 350. Intersection of Two Arrays II

Return the intersection of two integer arrays including duplicates — each value should appear min(count in nums1, count in nums2) times and order doesn’t matter. Typical approaches use a frequency hashmap or two-pointer scanning after sorting, with streaming/external-memory considerations for very large inputs.