Created
February 2, 2018 05:11
-
-
Save austriker27/f049d7119275dea0d2c1795835712ba7 to your computer and use it in GitHub Desktop.
This is a whiteboarding problem involving curly braces combos - it is very hard.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Problem Statement | |
Implement an algorithm to print all valid (i.e. properly opened and closed) combinations of n pairs of braces. | |
## Example: | |
Input : 3 | |
Output : | |
{{{}}} | |
{{}{}} | |
{{}}{} | |
{}{{}} | |
{}{}{} | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment