DSA Visualizations | Hello Interview

Generate Parentheses

DESCRIPTION (credit Leetcode.com)

Given an integer n, write a function to return all well-formed (valid) expressions that can be made using n pairs of parentheses.

EXAMPLES

Example 1:

Input:


n = 3

Output:


["((()))","(()())","(())()","()(())","()()()"]

Example 2:

Input:


n = 2

Output:


["()()", "(())"]

Run your code to see results here

Explanation

Let's start by figuring out how to incrementally generate all valid combinations of n pairs of parentheses starting from an empty string s = "". Doing so will help us visualize the "solution space tree" which we can then traverse using a recursive backtracking approach.

At each step below, we can add either an opening parenthesis '(' or a closing parenthesis ')' to the string s as long as the resulting string remains valid. Let's walkthrough the process of generating all valid combinations of parentheses for n = 2:

s = ``

If we start with an empty string, then we can only add an opening parenthesis '(', as adding a closing parenthesis ')' would result in an invalid combination.

s = (

We can add both an opening parenthesis '(' and a closing parenthesis ')' to the string s without making it invalid.

s = (( and s = ()

For this string s = ((: we can't add an opening parenthesis '(' to s as it would make it invalid. This is because the number of opening parentheses is already equal to n. However, we can add a closing parenthesis ')' to s.

For the string s = (): we can only add an opening parenthesis '(' as adding a closing parenthesis would make it invalid. This is because s has an equal number of opening and closing parentheses, and we need to add another opening parenthesis before we can add a closing parenthesis.

From this, we can notice two rules:

We can add an opening parenthesis '(' if the number of opening parentheses in s is less than n.
We can add a closing parenthesis ')' if the number of closing parentheses in s is less than the number of opening parentheses in s.

s = (() and s = ()(

For the string s = ((): we can only add a closing parentheses ')' (since there are already n = 2 opening parentheses in s)

For the string s = ()(: we can only add a closing parentheses ')' (since there are already n = 2 opening parentheses in s)

s = (()) and s = ()()

In both cases, the length of the string s is equal to 2 * n, so we are done.

If we visualize this process as a tree, we get the following:

Writing the Backtracking Function

Once we have this tree, we can use depth-first search to write a recursive backtracking function that generates all valid combinations of n pairs of parentheses.

At each node, we need the current string, and the number of opening and closing parentheses in the string. These are the parameters we'll pass to our recursive function.

def dfs(s, open, close):

At each node, we'll make recursive calls to our left child if the number of opening parentheses is less than n, and to our right child if the number of closing parentheses is less than the number of opening parentheses.

def dfs(s, open, close):
    # base case

    if open < n:
        # add an opening parenthesis and increment the open count
        dfs(s + '(', open + 1, close)
    
    if close < open:
        # add a closing parenthesis and increment the close count
        dfs(s + ')', open, close + 1)

The base case is when the length of the string is equal to 2 * n, at which point we'll add the string to our list of valid combinations.

def dfs(s, open, close):
    # base case
    if len(s) == 2 * n:
        res.append(s)
        return

    if open < n:
        # add an opening parenthesis and increment the open count
        dfs(s + '(', open + 1, close)
    
    if close < open:
        # add a closing parenthesis and increment the close count
        dfs(s + ')', open, close + 1)

In the main function, we'll initialize an empty list to store the valid combinations, and make the initial call to our recursive function with an empty string and counts of 0 for both opening and closing parentheses, and return the list of valid combinations at the end.

class Solution:
    def generateParenthesis(self, n: int) -> List[str]:
        res = []

        def dfs(s, open, close):
            # base case
            if len(s) == 2 * n:
                res.append(s)
                return

            if open < n:
                # add an opening parenthesis and increment the open count
                dfs(s + '(', open + 1, close)
            
            if close < open:
                # add a closing parenthesis and increment the close count
                dfs(s + ')', open, close + 1)
        
        dfs('', 0, 0)
        return res

Next: Combination Sum

Your account is free and you can post anonymously if you choose.

Loading comments...

Back to Home

Eliminating Pairs

Overview

Container With Most Water

3-Sum

Triangle Numbers

Pointers as Regions

Move Zeroes

Sort Colors

Trapping Rain Water

Variable-Length

Overview

Longest Substring Without Repeating Characters

Longest Repeating Character Replacement

Fixed-Length

Overview

Maximum Sum of Subarrays of Size K

Max Points You Can Obtain From Cards

Max Sum of Distinct Subarrays Length k

Overview

Can Attend Meetings

Insert Interval

Non-Overlapping Intervals

Merge Intervals

Employee Free Time

Overview

Valid Parentheses

Decode String

Longest Valid Parentheses

Monotonic Stack

Overview

Daily Temperatures

Largest Rectangle in Histogram

Overview

Linked List Cycle

Palindrome Linked List

Remove Nth Node From End of List

Reorder List

Swap Nodes in Pairs

Overview

Apple Harvest (Koko Eating Bananas)

Search in Rotated Sorted Array

Overview

Kth Largest Element in an Array

K Closest Points to Origin

Find K Closest Elements

Merge K Sorted Lists

Introduction

Binary Trees

Overview

Level Order Sum

Rightmost Node

Zigzag Level Order

Maximum Width of Binary Tree

Graphs

Overview

Minimum Knight Moves

Rotting Oranges

01-Matrix

Bus Routes

Overview

Word Search

Solution Space Trees

Subsets

Generate Parentheses

Combination Sum

Topological Sort

Overview

Course Schedule

Course Schedule II

Fundamentals

Solving a Question with Dynamic Programming

Counting Bits

Decode Ways

Maximal Square

Unique Paths

Longest Increasing Subsequence

Word Break

Maximum Profit in Job Scheduling

Overview

Best Time to Buy and Sell Stock

Gas Station

Jump Game

Overview

Implement Trie Methods

Prefix Matching

Overview

Count Vowels in Substrings

Subarray Sum Equals K

Spiral Matrix

Rotate Image

Set Matrix Zeroes

Subsets

Combination Sum

Generate Parentheses

DESCRIPTION (credit Leetcode.com)

Given an integer n, write a function to return all well-formed (valid) expressions that can be made using n pairs of parentheses.

EXAMPLES

Example 1:

Input:


n = 3

Output:


["((()))","(()())","(())()","()(())","()()()"]

Example 2:

Input:


n = 2

Output:


["()()", "(())"]

Run your code to see results here

Explanation

s = ``

If we start with an empty string, then we can only add an opening parenthesis '(', as adding a closing parenthesis ')' would result in an invalid combination.

s = (

We can add both an opening parenthesis '(' and a closing parenthesis ')' to the string s without making it invalid.

s = (( and s = ()

From this, we can notice two rules:

We can add an opening parenthesis '(' if the number of opening parentheses in s is less than n.
We can add a closing parenthesis ')' if the number of closing parentheses in s is less than the number of opening parentheses in s.

s = (() and s = ()(

For the string s = ((): we can only add a closing parentheses ')' (since there are already n = 2 opening parentheses in s)

For the string s = ()(: we can only add a closing parentheses ')' (since there are already n = 2 opening parentheses in s)

s = (()) and s = ()()

In both cases, the length of the string s is equal to 2 * n, so we are done.

If we visualize this process as a tree, we get the following:

Writing the Backtracking Function

Once we have this tree, we can use depth-first search to write a recursive backtracking function that generates all valid combinations of n pairs of parentheses.

At each node, we need the current string, and the number of opening and closing parentheses in the string. These are the parameters we'll pass to our recursive function.

def dfs(s, open, close):

def dfs(s, open, close):
    # base case

    if open < n:
        # add an opening parenthesis and increment the open count
        dfs(s + '(', open + 1, close)
    
    if close < open:
        # add a closing parenthesis and increment the close count
        dfs(s + ')', open, close + 1)

The base case is when the length of the string is equal to 2 * n, at which point we'll add the string to our list of valid combinations.

def dfs(s, open, close):
    # base case
    if len(s) == 2 * n:
        res.append(s)
        return

    if open < n:
        # add an opening parenthesis and increment the open count
        dfs(s + '(', open + 1, close)
    
    if close < open:
        # add a closing parenthesis and increment the close count
        dfs(s + ')', open, close + 1)

class Solution:
    def generateParenthesis(self, n: int) -> List[str]:
        res = []

        def dfs(s, open, close):
            # base case
            if len(s) == 2 * n:
                res.append(s)
                return

            if open < n:
                # add an opening parenthesis and increment the open count
                dfs(s + '(', open + 1, close)
            
            if close < open:
                # add a closing parenthesis and increment the close count
                dfs(s + ')', open, close + 1)
        
        dfs('', 0, 0)
        return res

Next: Combination Sum

Your account is free and you can post anonymously if you choose.

Loading comments...

BlogBehavioral Interview Examples Interviewing for Experienced SWEs All Blog Posts

Compare UsCompare to Interviewing.io

LinksFAQ Schedule Mock Interviews Pricing Become a Coach Our Coaches Learn System Design Learn DSA

LegalTerms and Conditions Privacy Policy

Contactsupport@hellointerview.com7511 Greenwood Ave North
Unit #4238 Seattle, WA 98103