Workspace

Problem workspace

3 day streakD

Longest Valid Parentheses

HardStacksSimulation & greedy

The challenge

Return the length of the longest contiguous well-formed parentheses substring.

Input contains only ( and ). Empty input returns 0.

Example

)()()) → 4.

Use the walkthrough below to inspect the input and each state change.

See Longest Valid Parentheses, step by step

Inspect each push, pop, and recorded answer. Entries such as 2: 5 mean index: value.

Zero-based input · top labeled explicitlyLIFO
Input and stack stateCurrent input index: -1. Main stack bottom to top: []. Auxiliary stack · bottom → top: []. Read the input in order. The stack keeps only the state needed to resolve the next item.)0(1)2(3)4)5Main stack · bottom → top ↑emptyAuxiliary · bottom → top ↑empty
Current input index
—
Main stack size
0
Step 01 / 9

Start with an empty stack

Read the input in order. The stack keeps only the state needed to resolve the next item.

Answer so far

Not recorded yet
Main stack · bottom → top
Empty
Auxiliary stack · bottom → top
Empty
View exact input and state

Input: [")","(",")","(",")",")"]

Main stack: []. Auxiliary stack · bottom → top: [].

Put it into code

Start with boundary −1; an unmatched closer becomes the new boundary.

Indices are zero-based. C++ uses C++17 or later.

def solve(values):
    stack, best = [-1], 0
    for i, c in enumerate(values):
        if c == '(': stack.append(i)
        else:
            stack.pop()
            if not stack: stack.append(i)
            else: best = max(best, i - stack[-1])
    return best

A good place to start

Explore a pattern

A little guidance

Start with a pattern, read through a problem, and mark it solved when the idea clicks. Save anything you want to revisit.

New tutorials are added one at a time. Your bookmarks and solved checkmarks stay in this browser.

Explore the roadmap