2MS 🥇|| BEATS 100% 🏆 || 🌟JAVA ☕
Code


# Code
```java []
class Solution {
    public List<Integer> intersection(int[][] nums) {
        List<Integer> ans = new ArrayList<>();
        
        int[] count  = new int[1001];
        
        for(int[] arr : nums){
            for(int i : arr){
                count[i]++;
            }
        }
        
       for(int i=0;i<count.length;i++){
           if(count[i]==nums.length){
               ans.add(i);
           }
       }
        
        return ans;
    }
}
```
![7b3ed9e7-75a3-497e-85ef-237ed4f4fef7_1735690315.3860667.png](https://assets.leetcode.com/users/images/e8a9d5c8-4d58-4933-87dc-e4250c1f0e97_1737265650.3261418.png)

['Java']