One Pass C++ easy
\n# Code\n\nclass Solution {\npublic:\n    vector<int> intersection(vector<vector<int>>& nums) {\n        unordered_map<int,int>Map;\n         vector<int>ans;\n
\n# Code\n```\nclass Solution {\npublic:\n    vector<int> intersection(vector<vector<int>>& nums) {\n        unordered_map<int,int>Map;\n         vector<int>ans;\n        int n=nums.size();\n\n        for(int i=0;i<nums.size();i++){\n         for(int j=0;j<nums[i].size();j++){\n            Map[nums[i][j]]++;\n            if(i==n-1 && Map[nums[i][j]]==n)ans.push_back(nums[i][j]);\n         }\n        }\n\n        sort(ans.begin(),ans.end());\n        return ans;\n    }\n};\n```
['C++']