Balanced Parentheses Checker

StackString

Write a function that takes a string containing only parentheses (characters ( and )), and determine if the string is balanced. A string is balanced if it consists of pairs of matching parentheses in the correct order. For example, () and (()) are balanced, but (, ), and (() are not.

Example 1

Input

[
  "()"
]

Output

true

Explanation. The string `()` contains one pair of matching parentheses.

Example 2

Input

[
  "(())"
]

Output

true

Explanation. The string `(())` contains two nested pairs of matching parentheses.

Example 3

Input

[
  "(()"
]

Output

false

Explanation. The string `(()` contains an unmatched `(`.

Example 4

Input

[
  "())("
]

Output

false

Explanation. The string `())(` has parentheses that are closed before being opened.

Example 5

Input

[
  "((((()))))"
]

Output

true

Explanation. The string has multiple nested pairs that are all correctly matched.

Example 6

Input

[
  "()()"
]

Output

true

Explanation. The string contains two independent matching pairs.

Example 7

Input

[
  "((("
]

Output

false

Explanation. The string contains three unmatched `(`.

Example 8

Input

[
  "))))"
]

Output

false

Explanation. The string contains three unmatched `)`.

Follow-up: Is there a way to extend this function to handle other types of brackets such as `{}`, `[]`?

Constraints:

The input string will only contain the characters `(` and `)`. It can be empty.

Views: 2