Add problem 3168: Minimum Number of Chairs in a Waiting Room

Author: EFanZh

src/lib.rs

@@ -2117,6 +2117,7 @@ pub mod problem_3160_find_the_number_of_distinct_colors_among_the_balls;
 pub mod problem_3162_find_the_number_of_good_pairs_i;
 pub mod problem_3163_string_compression_iii;
 pub mod problem_3164_find_the_number_of_good_pairs_ii;
+pub mod problem_3168_minimum_number_of_chairs_in_a_waiting_room;
 pub mod problem_3350_adjacent_increasing_subarrays_detection_ii;
 
 #[cfg(test)]

src/problem_3168_minimum_number_of_chairs_in_a_waiting_room/brute_force.rs

@@ -0,0 +1,40 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn minimum_chairs(s: String) -> i32 {
+        let mut total = 0;
+        let mut empty = 0;
+
+        for c in s.bytes() {
+            if c == b'E' {
+                if empty == 0 {
+                    total += 1;
+                } else {
+                    empty -= 1;
+                }
+            } else {
+                empty += 1;
+            }
+        }
+
+        total
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn minimum_chairs(s: String) -> i32 {
+        Self::minimum_chairs(s)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_3168_minimum_number_of_chairs_in_a_waiting_room/mod.rs

@@ -0,0 +1,18 @@
+pub mod brute_force;
+
+pub trait Solution {
+    fn minimum_chairs(s: String) -> i32;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [("EEEEEEE", 7), ("ELELEEL", 2)];
+
+        for (s, expected) in test_cases {
+            assert_eq!(S::minimum_chairs(s.to_string()), expected);
+        }
+    }
+}