DP-8 Grid Problems in Dynamic Programming | Competitive Programming | DSA

Поділитися
Вставка
  • Опубліковано 18 вер 2024

КОМЕНТАРІ • 35

  • @AYUSHRAGHUVANSHI6742
    @AYUSHRAGHUVANSHI6742 Місяць тому +1

    most underrated playlist for dp

  • @anshulsharma3137
    @anshulsharma3137 10 місяців тому +3

    Excellent Explanation brother, this is your best DP video in this series till now 🔥🔥

    • @TLE_Eliminators
      @TLE_Eliminators  10 місяців тому +4

      Wait for the Counting Towers problem, that is going to be even more interesting.

  • @shivamkumarmanjhi7948
    @shivamkumarmanjhi7948 14 днів тому

    bro appriciates your teaching skills , you have a very fine way of teaching , hopes you grow well

  • @antaniogrizman8206
    @antaniogrizman8206 10 місяців тому +2

    I would say best one on dp on grid..❤️
    Thank u bro

  • @AnshDwivediAD03
    @AnshDwivediAD03 5 місяців тому

    i have tried this question with the top down approach and i have successfully solved it thank u sir..

  • @neelkhandare5057
    @neelkhandare5057 10 місяців тому +1

    sir, your consistency is amazing #day8 understood

  • @aaryanjavalekar7249
    @aaryanjavalekar7249 4 місяці тому

    Absolutely brilliant!

  • @user-tr7gw4ok3c
    @user-tr7gw4ok3c 10 місяців тому +1

    Great video bhaiya

  • @mystic3549
    @mystic3549 9 місяців тому

    letsgoooo :)))understood everything plus the explanation is top-notch...tysm...

  • @musaddikkhan9720
    @musaddikkhan9720 10 місяців тому +2

    when I see your notification my heart to me :-Itni Khushi Itni Khushi
    BTW now i was able to make intution on dp question 😊 Thanks For playList....But I think it is Dp 8 not Dp 9 🤔

    • @PriyanshAgarwal
      @PriyanshAgarwal 10 місяців тому

      Thanks a lot. I will change the thumbnail, thanks for pointing it out.

    • @musaddikkhan9720
      @musaddikkhan9720 10 місяців тому

      @@PriyanshAgarwal 😊😊

  • @aadarshsharma8523
    @aadarshsharma8523 Місяць тому

    UNDERSTOOD

  • @austinscott4695
    @austinscott4695 10 місяців тому +1

    Thank you!

  • @harshitprandiyal3802
    @harshitprandiyal3802 8 місяців тому

    Great explanation !

  • @_PixelPioneer_
    @_PixelPioneer_ 10 місяців тому

    Big shoutout👏 for your awesome teaching style! Your way of breaking down coding concepts is top-notch. I love the theme of your code editor - it adds a cool touch. Is there any chance you could tell me the name of the theme?
    Thanks for being a coding inspiration!

    • @PriyanshAgarwal
      @PriyanshAgarwal 10 місяців тому +1

      Thanks a lot. The theme is brogrammer.

  • @Shreshta349
    @Shreshta349 4 місяці тому

    lets solve the problem which is the "Big Daddy" here cracked me up. xD
    you make it fun and easy to learn, thanks priyansh.

  • @adityaghosh6170
    @adityaghosh6170 Місяць тому +1

    Can anyone explain me that in the no. Of ways variation in the single checkpoint problem....why did the total no. Of ways from 0,0 to n-1,m-1 including that checkpoint is 16*3
    Please anyone. Why is it 16*3 and not 16+3??

    • @modemmanoj2192
      @modemmanoj2192 4 дні тому +1

      see, you can reach the check point in 16 ways and for each one of the 16 ways you can choose any one of 3 ways from the checkpoint to (n-1,m-1) to complete the path. Think of it as brute forcing all paths .Hope this helps .
      (P.S: If there were m and n ways possible ,the total ways would be m*n )

  • @pratik9449
    @pratik9449 8 місяців тому

    thank you

  • @technicalxavier1263
    @technicalxavier1263 9 місяців тому

    Sir at 11:13 you said that if i reach i=n-1 and j=m-1 number of ways is 1...my question is why is it one?why is a path even defined if you are at the destination.
    I know this doesnt change the answer as no value depends on the value at that cell but im curious to know why it was taken as 1.

    • @faiazmahmud6277
      @faiazmahmud6277 8 місяців тому +1

      U can think it this way... Imagine if there is only one cell and u are standing on it so how many ways can u reach there? It's more practical to say there is only 1 way rather than considering that there are 0 ways to reach from (a, b) to (a, b)...Thats why it is taken as 1

  • @dhruvsanghvi5562
    @dhruvsanghvi5562 3 місяці тому

    sir vo first q me if conditions hi nhi ban rhi mujhse

  • @codingasbackup9088
    @codingasbackup9088 8 місяців тому

    understood

  • @hardikjain-brb
    @hardikjain-brb 9 місяців тому

    What about the without dp you ticked?

  • @imranurrahman
    @imranurrahman 10 місяців тому

    understood

  • @abc-ym4zs
    @abc-ym4zs 10 місяців тому

    Bhaiya now I am in third year to improve my problem solving is cp necessary or leetcode and CSES sheet is ok bhaiya

    • @TLE_Eliminators
      @TLE_Eliminators  10 місяців тому

      You need to define what is ENOUGH for you and you would know the answer yourself.

    • @abc-ym4zs
      @abc-ym4zs 10 місяців тому

      @@TLE_Eliminators generally if you are in my position how you would have utilised next upcoming 6 months bhaiya please guide me feeling very low i haven't been this much depressed in my life bhaiya

    • @TLE_Eliminators
      @TLE_Eliminators  10 місяців тому +1

      leetcode + CSES

  • @manindhra748
    @manindhra748 10 місяців тому

    #day8