java easy Solution 100% faster
\nclass Solution {\n    public List<Integer> intersection(int[][] nums) {\n        ArrayList<Integer> al= new ArrayList<>();\n        int[] freq =new int[1001];
```\nclass Solution {\n    public List<Integer> intersection(int[][] nums) {\n        ArrayList<Integer> al= new ArrayList<>();\n        int[] freq =new int[1001];\n        for(int r=0;r<nums.length;r++){\n            for(int c=0;c<nums[r].length;c++){\n                freq[nums[r][c]]++;\n            }\n        }\n        int n=nums.length;\n        for(int i=0;i<freq.length;i++){\n            if(freq[i]==n) al.add(i);\n        }\n        return al;\n    }\n}\n```
['Array', 'Java']