✅✅C++ || Easy Solution
\nMethod-1(Simple Searching)\n\nclass Solution {\npublic:\n\n    vector intersection(vector>& nums) {\n        vector sol;\n         for(int i=0;i<nums[0].size(
\n**Method-1(Simple Searching)**\n\nclass Solution {\npublic:\n\n    vector<int> intersection(vector<vector<int>>& nums) {\n        vector<int> sol;\n         for(int i=0;i<nums[0].size();i++)\n            {\n            int f1=1;\n            for(int j=1;j<nums.size();j++)\n            {\n                int f2=0;\n                for(int p=0;p<nums[j].size();p++)\n                    if(nums[j][p]==nums[0][i]) {f2=1; break;}\n                if(f2==0) {f1=0; break;}\n            } \n            if(f1==1) sol.push_back(nums[0][i]);\n        }\n        sort(sol.begin(),sol.end());\n        return sol;\n    }\n};\n\n\n\n\n**Method-2** (Using Map)\n\'\'\'\nclass Solution {\npublic:\n\n    vector<int> intersection(vector<vector<int>>& nums) {\n        vector<int> ans;\n        map<int,int> mp;\n        int m=nums.size();\n        for(int i=0;i<m;i++){\n            int n=nums[i].size();\n            for(int j=0;j<n;j++)\n                mp[nums[i][j]]++;\n        }\n        \n        for(auto i=mp.begin();i!=mp.end();i++)\n            if(i->second==m)    ans.push_back(i->first);\n        \n        return ans;\n    }\n};\n\'\'\'
['C']