Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
31 changes: 31 additions & 0 deletions Backtracking/generateParentheses.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
/**
* Problem Statement: Given a number n pairs of parentheses, try to Generate all combinations of valid parentheses;
* @param {number} n - number of given parentheses
* @return {string[]} res - array that contains all valid parentheses
* @see https://leetcode.com/problems/generate-parentheses/
*/

const generateParentheses = (n) => {
const res = []

const solve = (chres, openParenthese, closedParenthese) => {
if (openParenthese === n && closedParenthese === n) {
res.push(chres)
return
}

if (openParenthese <= n) {
solve(chres + '(', openParenthese + 1, closedParenthese)
}

if (closedParenthese < openParenthese) {
solve(chres + ')', openParenthese, closedParenthese + 1)
}
}

solve('', 0, 0)

return res
}

export { generateParentheses }
5 changes: 5 additions & 0 deletions Backtracking/tests/GenerateParentheses.test.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,5 @@
import { generateParentheses } from '../generateParentheses'

test('generate all valid parentheses of input 3', () => {
expect(generateParentheses(3)).toStrictEqual(['((()))', '(()())', '(())()', '()(())', '()()()'])
})