Easy Approach // Java
\n\n# Code\n\nclass Solution {\n    public List<Integer> intersection(int[][] nums) {\n        List<Integer> ans = new ArrayList<>();\n        int[] count = new
\n\n# Code\n```\nclass Solution {\n    public List<Integer> intersection(int[][] nums) {\n        List<Integer> ans = new ArrayList<>();\n        int[] count = new int[1001];\n        \n        for(int[] arr : nums) {\n            for(int i : arr) {\n                count[i]++;\n            }\n        }\n\n        for(int i = 0; i < count.length; i++) {\n            if(count[i] == nums.length) {\n                ans.add(i);\n            }\n        }\n        return ans;\n    }\n}\n```
['Java']