Find minimum cost to reach top of floor.
O(n)
O(1)
def minCostClimbingStairs(cost): cost.append(0) for i in range(len(cost) - 3, -1, -1): cost[i] += min(cost[i + 1], cost[i + 2]) return min(cost[0], cost[1])