Easy Hashmap solution with C++
\nclass Solution {\npublic:\n    vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n        \n        map<int,int> mp1;\n        map<
```\nclass Solution {\npublic:\n    vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n        \n        map<int,int> mp1;\n        map<int,int> mp2;\n        vector<vector<int>> v(2);\n        \n\t\t// map to store the occurrence of the elements in nums1\n        for( auto x:nums1 ){\n            mp1[x]++;\n        }\n        \n\t\t// map to store the occurenece of the elements in nums2\n        for( auto x:nums2 ){\n            mp2[x]++;\n        }\n        \n\t\t// traversing in the nums1 vector\n        for( auto x:nums1 ){\n\t\t\t\n\t\t\t// checking the map of nums 2 for the elements which are in nums1 and updating that found value with -1 to avoid repititions\n            if( mp2.find(x) == mp2.end() and mp2[x] != -1 )\n            {   \n                mp2[x]--;\n                v[0].push_back(x);\n            }    \n        }\n\t\t\n\t\t// traversing the nums 2 vector\n        for( auto x:nums2 ){\n\t\t\n\t\t\t// checking the map of nums1 for the elements which are in nums2 and updating that found value with -1 to avoid repititions\n            if( mp1.find(x) == mp1.end() and mp1[x] != -1 )\n            {\n                mp1[x]--;\n                v[1].push_back(x);\n            }    \n        }\n\t\t\n\t\t// returning the vector of vector contaning the required elements.\n        return v;\n    }\n    \n};\n```
['Array', 'C', 'C++']