Think in Patterns #1 — Dynamic Programming

Count the number of ways to reach the n-th stair. You can climb 1 or 2 steps at a time. Your first instinct is to find a formula. Resist it. Look at the last step instead. First, look at the structu