perfectly clear code!! using c++
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n        unordered_map<int,int>map1;\n        unordered_map<int,int>map2;\n        for(int i=0;i<nums1.size();i++){\n            map1[nums1[i]]++;\n        }\n        for(int j=0;j<nums2.size();j++){\n            map2[nums2[j]]++;\n        }\n        vector<vector<int>>ans;\n        vector<int>v;\n        for(int i=0;i<nums1.size();i++){\n            if(map2[nums1[i]]==0){\n                v.push_back(nums1[i]);\n                map2[nums1[i]]=1;\n            }\n        }\n        ans.push_back(v);\n        vector<int>v2;\n        for(int i=0;i<nums2.size();i++){\n            if(map1[nums2[i]]==0){\n                v2.push_back(nums2[i]);\n                map1[nums2[i]]=1;\n            }\n        }\n        ans.push_back(v2);\n        return ans;\n    }\n};\n```
['Array', 'Hash Table', 'C++']