Leetcode 1249. Minimum Remove to Make Valid Parentheses

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.