C++  set solution
class Solution {\npublic:\n    vector> findDifference(vector& nums1, vector& nums2) {\n\t\n        vector>ans;\n        vectords;\n        vectords2;\n        u
class Solution {\npublic:\n    vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n\t\n        vector<vector<int>>ans;\n        vector<int>ds;\n        vector<int>ds2;\n        unordered_set<int>s;\n        unordered_set<int>s1;\n        for(auto &it:nums1)s.insert(it);\n         for(auto &it:nums2)s1.insert(it);\n        for(auto it:s1)\n        {\n           if(s.find(it)==s.end())ds.push_back(it);\n        }\n         for(auto it:s)\n        {\n           if(s1.find(it)==s1.end())ds2.push_back(it);\n        }\n        ans.push_back(ds2);\n        ans.push_back(ds);\n        return ans;\n    }\n};\n**Please do upvote if you liked it!!**
['C']