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.
Input: students =[[1,2],[2,2],[3,3],[1,3],[2,3]]Output: 3Explanation:
Bench 2 has two unique students:[1,2].Bench 3 has three unique students:[1,2,3].The maximum number of unique students on a single bench is3.
Input: students =[[1,1],[2,1],[3,1],[4,2],[5,2]]Output: 3Explanation:
Bench 1 has three unique students:[1,2,3].Bench 2 has two unique students:[4,5].The maximum number of unique students on a single bench is3.
To find the maximum number of students on a single bench, count the frequency of each bench number in the array. The answer is the highest frequency found.