How do you check for balanced parentheses using a Stack?

Difficulty: 3/10

Stacks, String Parsing, Algorithm Design

Balanced Parentheses

A Stack is ideal for matching nested delimiters because the most recently opened delimiter must be closed first. When an opening bracket is encountered, it is pushed. For a closing bracket, the top opening bracket must be its matching pair.

javascript

1
Time complexity: O(n).
2
Auxiliary space: O(n) in the worst case.
3
The Stack captures nested structure naturally.
4
A closing delimiter without an opening delimiter is invalid.
5
Any unmatched opening delimiter remaining at the end makes the expression invalid.

Scenario Questions

0-2 years experience

2-5 years experience

Follow-up Questions