Function dfs

javascript/0022-generate-parentheses.js:11–40

(n, combos = [], open = 0, close = 0, path = [])

var generateParenthesis = (n) => dfs(n);

const dfs = (n, combos = [], open = 0, close = 0, path = []) => {
    const isBaseCase = path.length === n * 2;
    if (isBaseCase) {
        combos.push(path.join('')); /* Space O(N + N) */

        return combos;
    }

    const isOpen = open < n;
    if (isOpen)
        backTrackOpen(
            n,
            combos,
            open,
            close,
            path,
        ); /* Time O(2^N) | Space O(2^N) */

    const isClose = close < open;
    if (isClose)
        backTrackClose(
            n,
            combos,
            open,
            close,
            path,
        ); /* Time O(2^N) | Space O(2^N) */

    return combos;
};

const backTrackOpen = (n, combos, open, close, path) => {
    path.push('('); /* Space O(N) */