1368. Minimum Cost to Make at Least One Valid Path in a Grid | 0-1 BFS | Dijkstras

Поділитися
Вставка
  • Опубліковано 17 січ 2025

КОМЕНТАРІ • 14

  • @ARYANMITTAL
    @ARYANMITTAL  7 годин тому +1

    My Uber Interview Experience - ua-cam.com/video/VGYJIX5yl74/v-deo.html
    My Coinbase Interview Experience - ua-cam.com/video/IjOC18b_dCw/v-deo.html
    My American Express Inteview Experience - ua-cam.com/video/c3UhYefhnqk/v-deo.html
    My JP Morgan & Chase Interview Experience - ua-cam.com/video/-jacTpY57no/v-deo.html
    ..... more coming soon (along with LLD course on Second Channel)

  • @syedmohammadarsalan2583
    @syedmohammadarsalan2583 3 години тому +2

    Bhiaya can you make a video on how you search for the jobs or reach recruiter when you want to switch

  • @vijeshsshetty
    @vijeshsshetty 5 годин тому

    Loved the code quality ❤

  • @mukulkhanna5071
    @mukulkhanna5071 7 годин тому +1

    great video bro

    • @ARYANMITTAL
      @ARYANMITTAL  7 годин тому

      Mukul bhai ❤️❤️❤️

  • @sidharthapaidi
    @sidharthapaidi 4 години тому +1

    I was trying to forcefully apply dp here, but ended up with tle..

    • @abdulazeem313
      @abdulazeem313 3 години тому +1

      Same here! I am not able to understand in grid problems where to apply dp and where to apply bfs,dfs

  • @Its_Shubham_Negi
    @Its_Shubham_Negi 6 годин тому

    Finally one hard question ❤❤❤

  • @sbakash-dk9fj
    @sbakash-dk9fj 4 години тому

    should i watch the previous videos before this bro

  • @TarunKumar-cn6in
    @TarunKumar-cn6in Годину тому

    Bhai thoda text size increase kr le

  • @SohanKumar-fp4ix
    @SohanKumar-fp4ix 5 годин тому

    Hello bhaiya, I have a confusion around this problem.
    When would we use only DP and when would we use Graph concepts + Dp in grid based questions

    • @ARYANMITTAL
      @ARYANMITTAL  2 години тому +1

      Usually these questions come up, when you have recently started watching my videos & haven't seen past videos. (And these kind of blanked statements are sometimes risky). But still here is the answer: Usually when it is 2/3 directional (eg of 2 is go right & down, eg of 3 is go right, diagonal-upright, diagonal-downright), its DP, when its 4/8 directional its BFS/DFS.
      Again, the essence is, when you can't come to same point, from where you left just know. (Then its DP)
      Now, again as i mentioned, there are cases of 'k' visit to same points etc, where you can determine the number of times you can visit same cell, then also you can try applying dp, but in these cases also its a mixture of dp & graph traversal

  • @UdhyaKumar-z4d
    @UdhyaKumar-z4d 7 годин тому

    1st viewer

    • @ARYANMITTAL
      @ARYANMITTAL  7 годин тому

      Mukul's was 22 seconds before 😂, but loved the love ❤️