Dungeon Game (LeetCode) | Dynamic Programming Explanation

  Рет қаралды 1,752

Jyotinder Singh

Jyotinder Singh

Күн бұрын

Пікірлер: 17
@Tiyasa-d8f
@Tiyasa-d8f 6 ай бұрын
the only intuitive video all over you tube! Thanks
@abulfazalsaif1595
@abulfazalsaif1595 2 жыл бұрын
gone through 3-4 videos but this was the best explanation. Thank you.
@divyatyagi2967
@divyatyagi2967 4 жыл бұрын
I have watched all videos there is to watch for this question, but only could understand your code walkthrough; thank you so much :))
@JyotinderSingh
@JyotinderSingh 4 жыл бұрын
I'm really glad you found this video useful! Be sure to subscribe for future content!
@nmnjn
@nmnjn 4 жыл бұрын
this is gonna change the game 💪🏻
@JyotinderSingh
@JyotinderSingh 4 жыл бұрын
Really means a lot mate :" ♥
@VishalSanghai
@VishalSanghai 4 жыл бұрын
Very good explaination, I was doing the mistake of going top-down, without thinking that values at i, j depend on the future values. Thanks!
@JyotinderSingh
@JyotinderSingh 4 жыл бұрын
Glad I could help! Be sure to subscribe for all the future content! ♥
@shreyanshshrivastava5395
@shreyanshshrivastava5395 4 жыл бұрын
Very nicely explained :D , didn't understand this concept from other videos. Also it was nice to see that you have timestamps as well in the video, that helped :)
@JyotinderSingh
@JyotinderSingh 4 жыл бұрын
Thank you so much! I'm glad you found this useful :) Subscribe for more upcoming videos!
@yudilokhande8915
@yudilokhande8915 4 жыл бұрын
Loved it!
@JyotinderSingh
@JyotinderSingh 4 жыл бұрын
Thanks man! ♥️♥️
@cicciopasticcio8469
@cicciopasticcio8469 4 жыл бұрын
Thanks, excellent explanation
@JyotinderSingh
@JyotinderSingh 4 жыл бұрын
Glad I could help!
@dangerousdookie8822
@dangerousdookie8822 4 жыл бұрын
Very well explained
@JyotinderSingh
@JyotinderSingh 4 жыл бұрын
Thanks fam! Means a lot man ♥
@thiccphone1166
@thiccphone1166 11 ай бұрын
Why would you want the minimum health at the end? I would want maximum health especially if you can carry health over to the next floor. TBH, wasn't really paying attention and you may have explained it but I don't get what you mean by "wasting health" since you aren't technically wasting anything since if the goal is only to reach (2,2) from (0,0) as long as you get to the location then the optimal solution is taking less steps. Since both solutions are equal, except one solution results in having more health at the end, it would be safe to assume that MORE health at the end is better rather than having the minimum. Having the maximum health means you will be prepared for the future, while having the minimum means you can only do the single task. So if the rule was to get there with the fewest steps, then health is irrelevant outside of being alive upon reaching the destination. If the rule was to get there before the princess's health reaches 0, say after every step she loses health and has a number of health points, the optimal solution would be to get as much health for the knight as possible and the princess has the minimum required to reach the goal. Given that the only rule is to reach the princess without dying then there are two solutions. If the question was what's the minimum health required by a knight to reach the princess then the optimal solution is still Down-Down-Right-Right as the minimum health require is 6, not 7. At the same time, my knight would be stronger by the time I reach the princess and your knight would be the weakest. My underdog knight could continue adventuring.
Writing Code That Runs FAST on a GPU
15:32
Low Level
Рет қаралды 577 М.
Mastering Dynamic Programming - How to solve any interview problem (Part 1)
19:41
VIP ACCESS
00:47
Natan por Aí
Рет қаралды 30 МЛН
Chain Game Strong ⛓️
00:21
Anwar Jibawi
Рет қаралды 41 МЛН
Сестра обхитрила!
00:17
Victoria Portfolio
Рет қаралды 958 М.
She made herself an ear of corn from his marmalade candies🌽🌽🌽
00:38
Valja & Maxim Family
Рет қаралды 18 МЛН
one year of studying (it was a mistake)
12:51
Jeffrey Codes
Рет қаралды 232 М.
Dynamic Programming isn't too hard. You just don't know what it is.
22:31
DecodingIntuition
Рет қаралды 242 М.
The Absolute Best Intro to Monads For Software Engineers
15:12
Studying With Alex
Рет қаралды 680 М.
5 Simple Steps for Solving Dynamic Programming Problems
21:27
Reducible
Рет қаралды 1,1 МЛН
What P vs NP is actually about
17:58
Polylog
Рет қаралды 147 М.
Decode Ways - Dynamic Programming - Leetcode 91 - Python
15:25
Maximal Square - Top Down Memoization - Leetcode 221
19:50
NeetCode
Рет қаралды 75 М.
Premature Optimization
12:39
CodeAesthetic
Рет қаралды 851 М.
Every Programming Language Ever Explained in 15 Minutes
15:29
Flash Bytes
Рет қаралды 368 М.
VIP ACCESS
00:47
Natan por Aí
Рет қаралды 30 МЛН