Climbing Stairs

Count the ways to reach the top when you can take 1 or 2 steps at a time. It looks like a brute-force recursion problem, but it's actually your first real dynamic programming question. Once you see the Fibonacci pattern hiding inside, a whole category of DP problems clicks into place.