Basic Problemscountingcombinatorics
Count Valid Parenthesis
Given n pairs of parentheses, count how many distinct strings of balanced, well-formed parentheses can be built from them.
Do this lesson first: climbing stairsThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself — that is the whole exercise.