Can anyone please help by giving a solution to the following problem, i have an interview tomorrow?
Find the maximum ways you can move to the nth floor of a building using three moves. Suppose you are on the ith floor, you can move either to the (i+1)th floor or to the (i+2)th floor or to the (i+3)th floor, but you can make the last move only k times. This problem was based on Dynamic Programming.