Skip to content

3168. Minimum Number of Chairs in a Waiting Room 👍

  • Time: $O(n)$
  • Space: $O(1)$
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
class Solution {
 public:
  int minimumChairs(string s) {
    int ans = 0;
    int chairs = 0;

    for (const char c : s) {
      chairs += c == 'E' ? 1 : -1;
      ans = max(ans, chairs);
    }

    return ans;
  }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
class Solution {
  public int minimumChairs(String s) {
    int ans = 0;
    int chairs = 0;

    for (final char c : s.toCharArray()) {
      chairs += c == 'E' ? 1 : -1;
      ans = Math.max(ans, chairs);
    }

    return ans;
  }
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
class Solution:
  def minimumChairs(self, s: str) -> int:
    ans = 0
    chairs = 0

    for c in s:
      chairs += 1 if c == 'E' else -1
      ans = max(ans, chairs)

    return ans