Climbing Stairs LeetCode Dynamic Programming 70. Climbing Stairs Solution Keep the number of distinct ways to climb n stairs. dict[n] = dict[n-1] + dict[n-2] Similar to induction, base case: n = 1 and n = 2 PREVIOUSWord Search IINEXTCoin Change