Using Map | C++
\nclass Solution {\npublic:\n    vector<int> intersection(vector<vector<int>>& nums) {\n        map<int,int>mp1;\n        vector<int>ans;\n        for(int i=0;i
```\nclass Solution {\npublic:\n    vector<int> intersection(vector<vector<int>>& nums) {\n        map<int,int>mp1;\n        vector<int>ans;\n        for(int i=0;i<nums[0].size();i++)\n        {\n            mp1[nums[0][i]]++;\n        }\n        for(int i=1;i<nums.size();i++)\n        {\n            vector<int>temp=nums[i];\n            for(int j=0;j<temp.size();j++)\n            {\n                if(mp1.find(temp[j])!=mp1.end())\n                {\n                    mp1[temp[j]]++;\n                }\n            }\n        }\n        for(auto it=mp1.begin();it!=mp1.end();it++)\n        {\n           if(it->second==nums.size())\n           {\n               ans.push_back(it->first);\n           }\n        }\n        return ans;\n    }\n};\n```
['C', 'C++']