Generate Parenthesis | Intuition + Code | Recursion Tree | Backtracking | Java
Problem Statement: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Example 1: Input: n = 3 Output: [“((()))”,”(()())”,”(())()”,”()(())”,”()()()”]Example 2: Input: n = 1 Output: [“()”] Solution: This problem can be solved using the concept of backtracking, Let’s see how to approach it. We have to write a function generate([], left, right, […]
September 24, 2024 | 23 DSA Patterns | No comments