Search⌘ K
AI Features

Solution: Minimum Remove to Make Valid Parentheses

Solution: Minimum Remove to Make Valid Parentheses gives a string of letters and parentheses. Remove the fewest parentheses and return a resulting string that forms a valid parenthesization.

Statement

Given a string, s, that may have matchedEach opening parenthesis, (, has a closing parenthesis, ), for it. and unmatchedThere is no corresponding closing parenthesis, ), for an opening parenthesis, (. parentheses, remove the minimum number of parentheses so that the resulting string represents a valid parenthesization. For example, the string “a(b)” represents a valid parenthesization while the string “a(b” doesn’t, since the opening parenthesis doesn’t have any corresponding closing parenthesis.

Constraints:

  • 1≤1 \leq s.length
...