301. Remove Invalid Parentheses

Hard

5.4K

263

Given a string `s`

that contains parentheses and letters, remove the minimum number of invalid parentheses to make the input string valid.

Return *a list of unique strings that are valid with the minimum number of removals*. You may return the answer in

**Example 1:**

Input:s = "()())()"Output:["(())()","()()()"]

**Example 2:**

Input:s = "(a)())()"Output:["(a())()","(a)()()"]

**Example 3:**

Input:s = ")("Output:[""]

**Constraints:**

`1 <= s.length <= 25`

`s`

consists of lowercase English letters and parentheses`'('`

and`')'`

.- There will be at most
`20`

parentheses in`s`

.

Accepted

379.6K

Submissions

804.9K

Acceptance Rate

47.2%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved