A dyck path is a sequence of steps from (0, 0) to (n, n) that lies strictly below, or touching, the diagonal line.
DISCLAIMER:
The greater the value of n, the longer it will take to load the visualizer! The web app may crash if n is too large!
As a general rule, I recommend inputting a positive integer less than or equal to 10 for n.