Question

Find minimum v such that it reaches top of the stair rotation

Answer 1

Given that one can start from the 0-the step or 1-the step, the task is to find the minimum cost to reach the top of the floor(N+1) by climbing N stairs. Examples: Input: a[] = { 16, 19, 10, 12, 18 } Output ...