Dynamic Programming
Problems solved by breaking them into overlapping subproblems.
Showing 1 of 1 problems
| Tags | |||
|---|---|---|---|
| 70 | Climbing Stairs | Easy | DP |
Last updated on
162. Find Peak Element
A peak element is an element that is strictly greater than its neighbors. Find a peak element in an array.
70. Climbing Stairs
You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?