Min Cost Climbing Stairs

About Min Cost Climbing Stairs

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.

Publisher

Subhrajit Makur

Category

education

Language

en

Explicit

No

First episode

14 Nov 2020

Latest episode

14 Nov 2020

Latest episodes

3 episodes in the feed.

1. 

   14 Nov 2020

   53. Maximum Subarray

   Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

2. 

   14 Nov 2020

   392. Is Subsequence

   Given a string s and a string t, check if s is subsequence of t. A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, "ace" is a subsequence of "abcde" while "aec" is not).

3. 

   14 Nov 2020

   Min Cost Climbing Stairs

   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.

Contact Min Cost Climbing Stairs

Guest appearances

Does not typically book guests

Based on episode analysis; this does not confirm that the show is currently accepting guests.