Basic Problemscountingcombinatoricsgrid
Pascal's Triangle
Given a number of rows n, generate Pascal's Triangle: a triangular array where each interior entry equals the sum of the two entries diagonally above it, with 1s running along both outer edges.
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.