Hashmap Accepted solution to make it easily Understandable
\nclass Solution {\n    public static List<Integer> intersection(int[][] nums) {\n\t\tList<Integer> list = new ArrayList<>();\n\t\tHashMap<Integer, Integer> map
```\nclass Solution {\n    public static List<Integer> intersection(int[][] nums) {\n\t\tList<Integer> list = new ArrayList<>();\n\t\tHashMap<Integer, Integer> map = new HashMap<>();\n\n\t\tfor (int i = 0; i < nums.length; i++) {\n\t\t\tfor (int j = 0; j < nums[i].length; j++) {\n\t\t\t\tif (map.containsKey(nums[i][j])) {\n\t\t\t\t\tmap.put(nums[i][j], map.get(nums[i][j]) + 1);\n\t\t\t\t} else {\n\t\t\t\t\tmap.put(nums[i][j], 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n        for (Map.Entry<Integer, Integer> ans : map.entrySet()) {\n\t\t\tif (ans.getValue() == nums.length) {\n\t\t\t\tlist.add(ans.getKey());\n\t\t\t}\n\t\t}\t\tCollections.sort(list);\n\t\treturn list;\n\t}\n}\n```
['Java']