Skip to content

Adding to backtracking #1289

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 5 commits into from
Feb 13, 2023
Merged

Adding to backtracking #1289

Changes from 2 commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
0171dc8
adding generate-parenthses algorithm
Ramzi-Abidi Feb 12, 2023
3b7f489
adding generateParenthses algorithm
Ramzi-Abidi Feb 12, 2023
f19ff03
adding generate parentheses algorithm
Ramzi-Abidi Feb 12, 2023
8b34991
fixing comments according to the JDoc comments, cleaning code
Ramzi-Abidi Feb 12, 2023
6273ee0
fixing comments
Ramzi-Abidi Feb 12, 2023
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
26 changes: 26 additions & 0 deletions Backtracking/generateParentheses.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
/*
* Problem Statement: Given a number n pairs of parenthses, try to Generate all combinations of valid parentheses
*
* link to problem: https://leetcode.com/problems/generate-parentheses/
*
*/

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

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

if (closedParenthese < openParenthese) {
generateParentheses(n, chres + ')', openParenthese, closedParenthese + 1, res)
}
}

const res = []
generateParentheses(3, [], 0, 0, res)

export { generateParentheses }