Bracket Inc. wants to ship out new products using their excess brackets. They have tasked you with generating every possible assortment of brackets for some n brackets where the brackets will match
A bracket match is an opening and closing version of the same kind of bracket beside each other ()
If a bracket matches then outer brackets can also match (())
n will be an even number
The valid brackets are ()[]{}
For example for n = 4 the options are
()()
(())
[][]
[[]]
{}{}
{{}}
[]()
()[]
(){}
{}()
[]{}
{}[]
({})
{()}
([])
[()]
{[]}
[{}]
You must accept n as a command line argument (entered when your app is ran) and print out all of the matches, one per line
(It will be called like node main.js 4 or however else to run apps in your language)
Any programming language may be used. 2 points will be given if you pass all the test cases with 1 bonus point going to whoevers performs the quickest and 1 for whoever can get the least amount of characters
To submit put the code and the language you used below
Added some simple constraints to reduce the number of unfiltered entries that need to be generated, bringing the n=10 time down to 10ish seconds. EDIT: if any of the test cases are n=12 or greater, probably best to fail this without testing. It's super inefficient memory wise.