You are given a 2D integer array of student data students, where students[i] = [student_id, bench_id] represents that student student_id is sitting on the bench bench_id.
Return the maximum number of unique students sitting on any single bench. If no students are present, return 0.
Note: A student can appear multiple times on the same bench in the input, but they should be counted only once per bench.
Example 1:
Input: students = [[1,2],[2,2],[3,3],[1,3],[2,3]]
Output: 3
Explanation:
[1, 2].[1, 2, 3].Example 2:
Input: students = [[1,1],[2,1],[3,1],[4,2],[5,2]]
Output: 3
Explanation:
[1, 2, 3].[4, 5].Example 3:
Input: students = [[1,1],[1,1]]
Output: 1
Explanation:
Example 4:
Input: students = []
Output: 0
Explanation:
Constraints:
0 <= students.length <= 100students[i] = [student_id, bench_id]1 <= student_id <= 1001 <= bench_id <= 100Loading editor...
[[1,2],[2,2],[3,3],[1,3],[2,3]]