You are coding as a Guest. Sign in with your RoleNest account to permanently track your streak, earn XP, and climb the Campus Leaderboard!
Sign In with RoleNestProblem Set
🔥Longest Valid Parentheses: Stack Boundary DPHard
SUPER HARD PROBLEM OF THE DAY+150 XP • FAANG OA TIER
High-difficulty challenge matching authentic Google, Amazon & Uber L5 online assessment conditions.
HardStack•Acceptance: 34.1%
Longest Valid Parentheses: Stack Boundary DP
Targeted in FAANG & Tech OA:MicrosoftGoogleAmazon
Real-World Engineering Context
Used in compiler frontends (LLVM, V8) and code formatters (Prettier) to locate well-balanced syntactic blocks and isolate bracket parsing errors.
Given a string containing just the characters `'('` and `')'`, return the length of the longest valid (well-formed) parentheses substring.
Sample Test Cases
Input: ["(()"]
Expected: 2
Input: [")()())"]
Expected: 4
Input: [""]
Expected: 0
Constraints
- 0 <= s.length <= 3 * 10^4
- s[i] is '(' or ')'.
Recruiter Fast-Track ReferralVerified Candidate
Direct pipeline to Google, Amazon, Microsoft, Swiggy, & Uber recruiters
Top DevScore profiles bypass resume screening filters. Every verified problem solve writes authentic proof-of-work to your profile and dispatches you directly into employer inboxes on RoleNest.
Explore 5,000+ Direct ATS Openings on RoleNest ↗✓ Direct Referral Active
Language:
Ready to test. Click Run Code or Submit Solution to run test cases in isolated browser sandbox.