Add solution #3450

JoshCrozier · JoshCrozier · commit 08cfa78629de · 2025-07-23T23:55:52.000-05:00
diff --git a/README.md b/README.md
@@ -2699,6 +2699,7 @@
 3442|[Maximum Difference Between Even and Odd Frequency I](./solutions/3442-maximum-difference-between-even-and-odd-frequency-i.js)|Easy|
 3443|[Maximum Manhattan Distance After K Changes](./solutions/3443-maximum-manhattan-distance-after-k-changes.js)|Medium|
 3445|[Maximum Difference Between Even and Odd Frequency II](./solutions/3445-maximum-difference-between-even-and-odd-frequency-ii.js)|Hard|
+3450|[Maximum Students on a Single Bench](./solutions/3450-maximum-students-on-a-single-bench.js)|Easy|
 3452|[Sum of Good Numbers](./solutions/3452-sum-of-good-numbers.js)|Easy|
 3461|[Check If Digits Are Equal in String After Operations I](./solutions/3461-check-if-digits-are-equal-in-string-after-operations-i.js)|Easy|
 3462|[Maximum Sum With at Most K Elements](./solutions/3462-maximum-sum-with-at-most-k-elements.js)|Medium|
diff --git a/solutions/3450-maximum-students-on-a-single-bench.js b/solutions/3450-maximum-students-on-a-single-bench.js
@@ -0,0 +1,37 @@
+/**
+ * 3450. Maximum Students on a Single Bench
+ * https://leetcode.com/problems/maximum-students-on-a-single-bench/
+ * Difficulty: Easy
+ *
+ * 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.
+ */
+
+/**
+ * @param {number[][]} students
+ * @return {number}
+ */
+var maxStudentsOnBench = function(students) {
+  const map = new Map();
+
+  for (const [studentId, benchId] of students) {
+    if (!map.has(benchId)) {
+      map.set(benchId, new Set());
+    }
+    map.get(benchId).add(studentId);
+  }
+
+  let result = 0;
+  for (const studentSet of map.values()) {
+    result = Math.max(result, studentSet.size);
+  }
+
+  return result;
+};
