Minimum Jumps With Fee
Let's solve the Minimum Jumps with Fee problem using Dynamic Programming.
Statement
You are given n
steps of stairs and a list fee
because each step has a fee associated with it. Your task is to calculate the minimum fee required to reach the top of the stairs (beyond the top step), assuming you start with the first step. At every step, you can take 1 step, 2 steps, or 3 steps.
Let’s say you have a staircase of six steps. The fee for each step is . The minimum cost to reach the top will be . This cost is calculated as follows:
- Starting from the first step,
Access this course and 1400+ top-rated courses and projects.