Generate Parantheses
Algorithms, Backtracking, Recursion, String, Leetcode
Before we start solving this problem, let’s do some math first. The problem statement clearly states that we have N pairs of parentheses to work with. That means for a string to be considered as part of the solution, it must be of size 2N.
Read More