There exists a staircase with N steps, and you can climb up either 1 or 2 steps at a time. Calculate the number of unique ways you can climb the staircase.
Tag: Dynamic Programming
Best Time to Buy and Sell Stock
Best Time to Buy and Sell Stock
Find Moving Average of Last N numbers in a Stream.
Given a stream of integers and a window size, calculate the moving average of all integers in the sliding window.
Trapping Rain Water between Towers
How Much Water Can A Bar Graph Hold?
Harshit Jain 