c++ easy solution || beginners friendly
```\nclass Solution {\npublic:\n    vector intersection(vector>& nums) {\n        unordered_map mp;\n        int k = 0;\n        int n = nums.size();\n        f
```\nclass Solution {\npublic:\n    vector<int> intersection(vector<vector<int>>& nums) {\n        unordered_map<int,int> mp;\n        int k = 0;\n        int n = nums.size();\n        for(int i=0;i<n;i++)\n        {\n            for(int j=0;j<nums[i].size();j++)\n            {\n                mp[nums[i][j]]++;\n            }\n        }\n        vector<int> v;\n        for(auto it : mp)\n        {\n            if(it.second == n)\n            {\n                v.push_back(it.first);\n            }\n        }\n        sort(v.begin(),v.end());\n        return v;\n    }\n};\n
['C']