very easy cpp solution using map
\'\'\'\nclass Solution {\npublic:\n    vector intersection(vector>& nums) {\n        unordered_mapmp;\n        for(int i=0;i<nums.size();i++){\n            for(
\'\'\'\nclass Solution {\npublic:\n    vector<int> intersection(vector<vector<int>>& nums) {\n        unordered_map<int,int>mp;\n        for(int i=0;i<nums.size();i++){\n            for(int j=0;j<nums[i].size();j++){\n                mp[nums[i][j]]++;\n            }\n        }\n        vector<int>ans;\n        for(auto i:mp){\n            if(i.second==nums.size()) ans.push_back(i.first);\n        }\n        sort(ans.begin(),ans.end());\n        return ans;\n    }\n};
['C', 'C++']