Available question text
Given a string of lowercase letters and parentheses, remove the minimum number of '(' or ')' characters so the remaining string is a valid parentheses string (properly matched and nested), returning any valid result while preserving character order. The core challenge is identifying and deleting unmatched parentheses (n up to 1e5) to achieve a balanced sequence.
Related questions
Continue with questions that share topics or the same question type.
- Minimum Add to Make Parentheses Valid
Coding · Bracket Sequences · Greedy · Stack
- Minimum Additions to Make Valid String
Coding
- Minimum Adjacent Swaps to Make a Valid Array
Coding
- Minimum Cost to Make at Least One Valid Path in a Grid
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 3 records
Bloomberg
Leetcode 1249. Minimum Remove to Make Valid Parentheses
Reported Sep 30, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View sourceMeta
Leetcode 1249. Minimum Remove to Make Valid Parentheses
Reported May 22, 2026 · 112 source reports
MANAGER, MID_LEVEL, SENIOR, STAFF
Source snapshot: Nov 12, 2026
View sourceMicrosoft
Leetcode 1249. Minimum Remove to Make Valid Parentheses
Reported Nov 1, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source