Tap here to switch tabs
Problem
Submissions

Problem: Remove Invalid Parentheses

Remove Invalid Parentheses asks you to remove as few parentheses as possible from a string, then return every unique version whose parentheses are properly matched and nested.

Statement

You are given a string, s, that contains:

  • Lowercase English letters

  • Opening '(' and closing ')' parentheses

A string is considered valid if:

  1. All opening parentheses '(' are closed properly by a matching ')'.

  2. The parentheses are in the correct order and nesting.

  3. Letters can appear anywhere and do not affect validity.

Return all possible valid strings that can be formed by removing the minimum number of invalid parentheses. The answer must be a list of unique strings, in any order.

Constraints:

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

  • s consists of lowercase English letters and parentheses '(' and ')'.

  • There will be at most 20 parentheses in s.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Remove Invalid Parentheses

Remove Invalid Parentheses asks you to remove as few parentheses as possible from a string, then return every unique version whose parentheses are properly matched and nested.

Statement

You are given a string, s, that contains:

  • Lowercase English letters

  • Opening '(' and closing ')' parentheses

A string is considered valid if:

  1. All opening parentheses '(' are closed properly by a matching ')'.

  2. The parentheses are in the correct order and nesting.

  3. Letters can appear anywhere and do not affect validity.

Return all possible valid strings that can be formed by removing the minimum number of invalid parentheses. The answer must be a list of unique strings, in any order.

Constraints:

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

  • s consists of lowercase English letters and parentheses '(' and ')'.

  • There will be at most 20 parentheses in s.