Python Solution || Hashmap
\nclass Solution:\n    def intersection(self, nums: List[List[int]]) -> List[int]:\n        d = {}\n        \n        for i in range(len(nums)):\n            fo
```\nclass Solution:\n    def intersection(self, nums: List[List[int]]) -> List[int]:\n        d = {}\n        \n        for i in range(len(nums)):\n            for j in nums[i]:\n                if j not in d:\n                    d[j] = 1\n                else:\n                    d[j]+=1\n                    \n        res = []\n        for k,v in d.items():\n            if v == len(nums):\n                res.append(k)\n                \n        return sorted(res)\n```
['Python3']