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 \leq$ s.length $\leq 25$

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

• There will be at most 20 parentheses in s.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.