A code editor's test suite needs sample snippets made of brackets. A snippet uses exactly n pairs of ( and ) and must be balanced: reading left to right, there are never more ) than ( so far, and the totals are equal at the end.
The editor's linter also rejects nesting deeper than maxDepth. The depth at a point is the number of ( opened and not yet closed.
Write balancedSnippets(n, maxDepth) that returns every balanced snippet with n pairs whose depth never goes above maxDepth, sorted ascending (( sorts before )).
Input: n = 3, maxDepth = 3 Output: ["((()))","(()())","(())()","()(())","()()()"]
With depth up to 3 allowed, all five balanced snippets of 3 pairs are valid.
Input: n = 3, maxDepth = 1 Output: ["()()()"]
With depth 1, every ( must close before the next one opens.
1 <= n <= 81 <= maxDepth <= 8Run tries your code on the examples. Submit runs every test, including hidden edge cases, and solves the problem when they all pass.
Ctrl + Enter runs, Ctrl + Shift + Enter submits (⌘ on a Mac).
I'm here to help with #288 Balanced Bracket Snippets. I give hints, never the solution, so you get to solve it yourself. Ask for a hint, select code to ask about it, or press Ask Tuto why on a failing test.
Your first 3 answers need no account. for free to keep asking.