Time -O(n) || Space -O(n) || C++ Solution
\nclass Solution {\npublic:\n    vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n        unordered_map<int,int> umap1;\n        un
```\nclass Solution {\npublic:\n    vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n        unordered_map<int,int> umap1;\n        unordered_map<int,int> umap2;\n        vector<vector<int>> result(2);\n        for(int i=0;i<nums1.size();i++)\n        {\n            umap1[nums1[i]]=1;\n        }\n        for(int i=0;i<nums2.size();i++)\n        {\n            umap2[nums2[i]]=1;\n        }\n        set<int> st;\n        for(int i=0;i<nums1.size();i++)\n        {\n            if(umap2[nums1[i]]==0)\n            {\n                st.insert(nums1[i]);\n            }\n        }\n       for (auto itr = st.begin(); itr != st.end(); itr++) \n           {\n               int t=*itr;\n               result[0].push_back(t);\n           }\n        \n       set<int> st1;\n        for(int i=0;i<nums2.size();i++)\n        {\n            if(umap1[nums2[i]]==0)\n            {\n                st1.insert(nums2[i]);\n            }\n        }\n       for (auto itr = st1.begin(); itr != st1.end(); itr++) \n           {\n               int t=*itr;\n               result[1].push_back(t);\n           }\n       return result;       \n        \n    }\n};\n```\n**Like it? Please Upvote ;-)**
['C', 'C++']