C++ || Easy Solution || Easy to Understand
class Solution {\npublic:\n    vector intersection(vector>& nums) {\n    unordered_mapy;\n        vectorw;\n        int i,j;\n        for(i=0;isecond==nums.size
class Solution {\npublic:\n    vector<int> intersection(vector<vector<int>>& nums) {\n    unordered_map<int,int>y;\n        vector<int>w;\n        int i,j;\n        for(i=0;i<nums.size();i++){\n            for(j=0;j<nums[i].size();j++){\n            y[nums[i][j]]++;\n            \n        }}\n        for(auto it=y.begin();it!=y.end();it++){\n            if(it->second==nums.size()){\n              w.push_back(it->first);  \n            }\n        }\n     sort(w.begin(),w.end());\n        \n return w;   }\n};
['C']