Basic Problemscountingcombinatorics
Ways to Triangulate a Polygon
Given a convex polygon with n vertices, count the number of ways to split its interior into triangles using diagonals that never cross each other.
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.