Recursion, Catalan Numbers & Generating Functions · Superchallenge problem

A mountain range is drawn with $7$ upstrokes and $7$ downstrokes: a path of $14$ unit diagonal steps that starts on the ground, ends on the ground, and never goes below it. How many such ranges touch the ground exactly $3$ times after the start (the final point counts as a touch)?