Easy✅ JAVA☕ Solution.
Please upvote if you understood the solution!!\n\nclass Solution {\n    public List<Integer> intersection(int[][] nums) {\n        List<Integer> list = new Arra
**Please upvote if you understood the solution!!**\n```\nclass Solution {\n    public List<Integer> intersection(int[][] nums) {\n        List<Integer> list = new ArrayList<>();\n        for (int j = 0; j < nums[0].length; j++) {\n            list.add(nums[0][j]);\n        }\n        for (int i = 1; i < nums.length; i++) {\n            List<Integer> list1 = new ArrayList<>();\n            for (int j = 0; j < nums[i].length; j++) {\n                if (list.contains(nums[i][j])) {\n                    list1.add(nums[i][j]);\n                }\n            }\n            list = list1;\n        }\n         Collections.sort(list);\n        return list;\n    }\n}\n```\n# upvote
['Java']