C++ Sol
Create an ordered map and vector (dynamic array). \nSurf the vectorvectorint>>nums and store the items present in the map with their frequency. \nCheck to deter
Create an ordered map and vector (dynamic array). \nSurf the vectorvectorint>>nums and store the items present in the map with their frequency. \nCheck to determine whether the frequency of the stored element is equal to the size of the vector. If the frequency is the same, then insert that element into the vector. \nFinally, since the specified return type is vector, return the vector.\n\n\n# Code\n```\nclass Solution {\npublic:\n    vector<int> intersection(vector<vector<int>>& nums) {\n        map<int,int>sol;\n        int s = nums.size();\n        vector<int>ans;\n        for(int i = 0;i<nums.size();i++){\n            for(int j = 0;j<nums[i].size();j++){\n                sol[nums[i][j]]++;\n            }\n            for(auto x : sol){\n                if(x.second == s){\n                    ans.push_back(x.first);\n                }\n            }\n        }\n        return ans;\n    }\n};\n```
['C++']