Subhrajit Makur
Min Cost Climbing Stairs
Categories
Courses, Education
Number of episodes
3
Published on
2020-11-14 11:29:00
Language
English
Categories
Courses, Education
Number of episodes
3
Published on
2020-11-14 11:29:00
Language
English
This podcast is about solving leet code Problems which described below On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed). Once you pay the cost, you can either climb one or two steps. You need to find minimum cost to reach the top of the floor, and you can either start from the step with index 0, or the step with index 1.
Subhrajit Makur
Sign up to track rankings and reviews from Spotify, Apple Podcasts and more.