C++|| 16ms || 68% Bruteforce approach with explanation
\nclass Solution {\npublic:\n    vector<int> intersection(vector<vector<int>>& nums) {\n        map<int,int>sk;\n        vector<int>sk1;\n        vector<int>res
```\nclass Solution {\npublic:\n    vector<int> intersection(vector<vector<int>>& nums) {\n        map<int,int>sk;\n        vector<int>sk1;\n        vector<int>res;\n        for(int i=0;i<nums.size();i++){ ///////storing all elements in single array;\n            for(int j=0;j<nums[i].size();j++){\n                sk1.push_back(nums[i][j]);\n            }\n        }\n\t\t\n        for(int i=0;i<sk1.size();i++){ ////now adding all elements in map\n            sk[sk1[i]]++;\n            \n        }\n        \n        for(auto i:sk){\n            \n            if(i.second==nums.size()){ //checking if duplicate element size is equal to nums.size() means it present in all three then pushing into result vector\n                res.push_back(i.first);\n            }\n        }\n        \n        return res;\n    }\n};\n```
['C']