Easy C++ Solution || unordered_set
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```cpp []\nclass Solution {\npublic:\n    vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n        unordered_set<int>s1(nums1.begin(),nums1.end());\n        unordered_set<int>s2(nums2.begin(),nums2.end());\n        vector<vector<int>>ans;\n        vector<int>v;\n        for(auto &x :s1)\n        {\n            if(s2.find(x)==s2.end())\n            {\n                v.push_back(x);\n            }\n        }\n        ans.push_back(v);\n        v.clear();\n        for(auto &x :s2)\n        {\n            if(s1.find(x)==s1.end())\n            {\n                v.push_back(x);\n            }\n        }\n        ans.push_back(v);\n        return ans;\n\n    }\n};\n```
['Array', 'Hash Table', 'C++']