BEATS MEMORY 91.23 % But Time LESS !
Intuition\nTo find the unique elements in two arrays that are not present in the other, we can first sort both arrays and remove duplicates. After that, we can 
# Intuition\nTo find the unique elements in two arrays that are not present in the other, we can first sort both arrays and remove duplicates. After that, we can check each element of one array against the other to identify the differences.\n\n# Approach\n1.) Sort both input arrays and remove duplicates using std::unique.\n2.) For each element in the first array, check if it exists in the second array. If it does not exist, add it to the result.\n3.) Repeat the process for the second array.\n4.) Return a vector containing the unique elements from both arrays.\n\n# Complexity\n- Time complexity: \n**O(nlogn)** (for sorting)\n\n- Space complexity:\n**O(n)** (for storing the unique elements)\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    vector<vector<int>> findDifference(vector<int>& arr1, vector<int>& arr2) {\n        \n               \n        sort(arr1.begin(), arr1.end());\n        sort(arr2.begin(), arr2.end());\n        \n         auto it1 = unique(arr1.begin(), arr1.end());\n         auto it2 = unique(arr2.begin(), arr2.end());\n         \n         arr1.erase(it1, arr1.end());\n         arr2.erase(it2, arr2.end());\n         \n        vector<int> dp;\n        vector<int> dp2;\n       \n        \n        for(auto i : arr1){\n             auto it = find(arr2.begin(), arr2.end(), i);\n             if(it != arr2.end()){\n                 NULL;\n             }\n             else{\n                 dp.push_back(i);\n             }\n        }\n        \n        for(auto i : arr2){\n             auto it = find(arr1.begin(), arr1.end(), i);\n             if(it != arr1.end()){\n                 NULL;\n             }\n             else{\n                 dp2.push_back(i);\n             }\n        }\n        \n        return {dp,dp2};\n\n    }\n};\n```
['C++']