Min Cost Climbing Stairs

Subhrajit Makur
  • 0.0(0개의 평가)
  • 강의

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.

에피소드

  1. 2020. 11. 14.

    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분

  2. 2020. 11. 14.

    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).

    6분

  3. 2020. 11. 14.

    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.

    5분
  • 3개의 에피소드

소개

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
  • 에피소드
    3
  • 등급
    전체 연령 사용가
  • 저작권
    © Subhrajit Makur
  • 웹사이트 보기
    Min Cost Climbing Stairs