Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in JavaScript

Solution: Remove Invalid Parentheses

Explore how to apply backtracking algorithms to remove the minimum number of invalid parentheses from a string. Understand balancing techniques, recursive choices, and how to generate all valid combinations efficiently in JavaScript.

We'll cover the following...

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≤ ...