Available question text
Given a string containing letters and parentheses, remove the minimum number of parentheses to produce all distinct valid parentheses strings and return them. The core challenge is to search the space of deletions (ensuring minimal removals and uniqueness) while efficiently pruning invalid or duplicate candidates.
Related questions
Continue with questions that share topics or the same question type.
- Brace Expansion
Coding · Backtracking · Breadth-First Search · Sorting
- Generate Parentheses
Coding · Backtracking · Bracket Sequences · Dynamic Programming
- Accounts Merge
Coding · Array · Breadth-First Search · Depth-First Search
- Alien Dictionary
Coding · Array · Breadth-First Search · Depth-First Search
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Meta
Leetcode 301. Remove Invalid Parentheses
Reported May 1, 2025 · 6 source reports
MID_LEVEL, STAFF
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Meta
Remove Invalid Parentheses
Reported date not specified · Source window: 30d
Source snapshot: Oct 20, 2026
Source frequency score: 72.1. This is not an interview probability.
View source