Generate Parentheses
Explore how to generate all valid combinations of balanced parentheses for a given number n. This lesson helps you understand the underlying pattern of balanced structures, practice implementing algorithms in Go, and build foundational skills useful for many coding interview problems involving subsets and constraints.
We'll cover the following...
Statement
For a given number, n, generate all combinations of balanced parentheses.
Constraints:
-
n
Examples
Understand the problem
Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:
Generate Parentheses
Which is a valid combination of balanced parentheses when n = 2?
()()
(())
((()
(())
))((
()()
()()
(())
Figure it out!
We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.
Try it yourself
Implement your solution in main.go in the following coding playground. We have provided a useful code template in the other file, that you may build on to solve this problem.
package mainfunc generateCombinations(n int)[][]rune {// Replace this placeholder return statement with your codereturn make([][]rune, 0)}