You are given an integer array cost where cost[i] represents the cost of stepping on the i-th stair.
Once you pay the cost, you can climb either one or two steps. You can start from step 0 or step 1.
Return the minimum cost required to reach the top of the floor.
(The top is beyond the last index.)
Follow for more 🚀
#leetcode #dsa #coding #programming #dynamicprogramming #algorithms #interviewprep #softwareengineer #learncoding #tech #coders #problemsolving
