JAVA STREAM SOLUTION 🧵
THIS IS NOT FASTER SOLUTION\nBUT 1 LINE CODE\n\nclass Solution {\n    public List<Integer> intersection(int[][] nums) {\n\t\t//return Arrays.stream(nums).flatMa
`THIS IS NOT FASTER SOLUTION`\n`BUT 1 LINE CODE `\n```\nclass Solution {\n    public List<Integer> intersection(int[][] nums) {\n\t\t//return Arrays.stream(nums).flatMapToInt(Arrays::stream).boxed().collect(Collectors.toMap(i -> i, i -> 1, Integer::sum)).entrySet().stream().sorted(Map.Entry.comparingByValue()).filter(item -> item.getValue() == nums.length).map(Map.Entry::getKey).sorted().collect(Collectors.toList());\n\n        return Arrays.stream(nums)\n                .flatMapToInt(Arrays::stream)\n                .boxed()\n                .collect(Collectors.toMap(i -> i, i -> 1, Integer::sum))\n                .entrySet()\n                .stream()\n                .sorted(Map.Entry.comparingByValue())\n                .filter(item -> item.getValue() == nums.length)\n                .map(Map.Entry::getKey)\n                .sorted()\n                .collect(Collectors.toList());\n    }\n}\n```
['Java']