Min Cost Climbing Stairs (LeetCode 746) | Full solution with thought process and animations

Поделиться
HTML-код
  • Опубликовано: 4 дек 2024

Комментарии • 13

  • @dineshkm7832
    @dineshkm7832 2 месяца назад +3

    Best solution I've seen for this problem. This channel is so underrated.

  • @santasingh9045
    @santasingh9045 4 месяца назад

    great explanation nikhil! The delivery and quality is top notch

  • @dineshkm7832
    @dineshkm7832 2 месяца назад

    I always search ur u tube to vlear any confusion ..great job

  • @unknownman1
    @unknownman1 4 месяца назад +1

    Similar to the house robber I. Thanks for the explanation.

  • @yourhelper433
    @yourhelper433 Месяц назад

    Excellent explanation sir

  • @sudheeri1171
    @sudheeri1171 4 месяца назад +1

    You are amazing at presenting the DSA.
    Could you please sort the DSA questions based on Blind 75 or Interview 150 or some other sheet?
    It would be great for revision or for learning quickly in a couple of months

  • @ianuj4231
    @ianuj4231 3 дня назад

    thank you... u are great from your solution... could derive the space optimized.. one..
    class Solution {
    public:
    int minCostClimbingStairs(vector& nums) {
    int n = nums.size();
    int prev2=0, prev1=0;
    for(int i=2;i

  • @Homelander_30
    @Homelander_30 4 месяца назад +1

    Hey bro,Will you please make a video on collection framework?? Much needed one.

  • @vidhyabaskar202
    @vidhyabaskar202 4 месяца назад

    Good explanation Nikhil !

  • @shaikmubashira5836
    @shaikmubashira5836 3 месяца назад

    this is my first playlist where i didnt skipped a video or changed playlist while learning programming , thank u sir

  • @urvashichaurasia6284
    @urvashichaurasia6284 5 месяцев назад

    Please upload more videos on hard leetcode problem

  • @Busybee-x4l
    @Busybee-x4l 14 дней назад

    maza aa gya

  • @Busybee-x4l
    @Busybee-x4l 14 дней назад

    merei professor ne ye mid sem mei de diya