LEETCODE 22 (JAVASCRIPT) | GENERATE PARENTHESES

Hey everyone. Check out this in-depth solution for leetcode 22.

[@praveengautam4689]

brother thank you i was about give up backtracking but your videos helped me to go on.

[@mikecastor2047]

This is a really great video. The DFS traversal that his solution utilizes is in fact backtracking even without the optimization that he shows using the openCount versus closedCount. What he calling backtracking is actually called pruning the tree.

[@binhtruongdac2861]

you did a very good explanation

[@VaIrMp]

very good but the audio is very quiet

[@CarmelFranco]

Hi Andy, can i know what is the name of the drawing application you are using please?