C++ || EASY SOLUTION || UNOREDERED MAP
\n\n    class Solution {\n    public:\n    vector intersection(vector>& nums) {\n        vectorvect;\n        int y=nums.size();\n        unordered_mapmp;\n    
\n\n    class Solution {\n    public:\n    vector<int> intersection(vector<vector<int>>& nums) {\n        vector<int>vect;\n        int y=nums.size();\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        for(auto x:mp){\n            if(x.second>=y){\n                vect.push_back(x.first);\n            }\n        }\n        sort(vect.begin(),vect.end());\n        return vect;\n      }\n    };\n   \n   \n   \n**IF U FIND IT USEFUL PLEASE UPVOTE IT**
['C']