Beginners Friendly || Unordered_map || C++ Solution || Easy to Understand
\nclass Solution {\npublic:\n    vector<int> intersection(vector<vector<int>>& nums) {\n        int n=nums.size();\n        vector<int> result;\n        unorder
```\nclass Solution {\npublic:\n    vector<int> intersection(vector<vector<int>>& nums) {\n        int n=nums.size();\n        vector<int> result;\n        unordered_map<int,int> umap;\n        for(int i=0;i<nums.size();i++)\n        {\n            for(int j=0;j<nums[i].size();j++)\n            {\n                if(umap[nums[i][j]]<i+1)\n                {\n                    umap[nums[i][j]]++;\n                }\n            }\n        }\n        \n        for(auto i=umap.begin();i!=umap.end();i++)\n        {\n            if(i->second==n)\n            {\n                result.push_back(i->first);\n            }\n        }\n        sort(result.begin(),result.end());\n        return result;\n    }\n};\n```\n**Like it? Please Upvote ;-)**
['C', 'C++']