Leetcode 350: https://leetcode.com/problems/intersection-of-two-arrays… — C Programming Language || Hands On Coding — TG.ME

class Solution {
public:
    std::vector<int> intersect(std::vector<int>& nums1, std::vector<int>& nums2) {
        std::unordered_map<int, int> numsMap;
        std::vector<int> intersectedNums;

        for (int num : nums1) {
            numsMap[num]++;
        }

        for (int num : nums2) {
            if (numsMap.find(num) != numsMap.end() && numsMap[num] > 0) {
                intersectedNums.push_back(num);
                numsMap[num]--;
                if (numsMap[num] == 0) {
                    numsMap.erase(num);
                }
            }
        }

        return intersectedNums;
    }
};