| Название | : | Dynamic Programming - Learn to Solve Algorithmic Problems u0026 Coding Challenges |
| Продолжительность | : | 5.10.02 |
| Дата публикации | : | |
| Просмотров | : | 3,7 jt |
 |
Amazing content! Thanks a lot I can say I've learned a ton 😍 Comment from : Asma Mir |
 |
why is line 9 in 1:39:42 considered to be an early return? what is early about it? Comment from : argath_vugto |
 |
at 1:28:29, it should memo[remainder] rather than memo[targetSum] at line 10 ? Comment from : Geetika Agrawal |
 |
For the bestSum problem, can't we sort the number list in a descending order which will allow the algorithm to minus the largest available number first in order to get the shortest results? Comment from : William Yeoh |
 |
OMG I LOVE THIS GUY! This is the absolute god of dynamic programming The CS-version of 3B1B Comment from : David Wang |
 |
good content, but the guy pronounces "linear" strangely - he says it like "li-near" instead of "li-knee-are" Comment from : Powning Atheists |
 |
For tabular bestSum, you don't have to compare the length of the arrays If you're iterating through and filling in the future values as you go, you can just skip if the value you're filling isn't null Comment from : Isaac Poulton |
 |
Thanks! Comment from : cooolway |
 |
So far the best video I have gone through for DP!!!, Thanks Alvin for taking the time for such quality content 😊😊 Comment from : M S S Prakash Yashwanth |
 |
1:09:58 Comment from : Ankur 4 |
 |
Why was the time for cansum() still O(m) after we had the memo object Comment from : Bottle?? |
|
|
38:45 Comment from : Ankur 4 |
 |
Hard to understand for beginners İt pure perfect Comment from : Mentalist |
 |
Never seen such a good clear explanation of how to calculate time complexity Which way would you prefer to get the nth element in a Fibonacci sequence? recursive way or in a for loop? Comment from : Charu Agarwal |
 |
one of the best explanation videos i've seen covering dynamic programming topic Comment from : Mohammed Maher |
 |
I’m new to programming, Can someone help me please ? brbrI have tried to follow this video but the moment I run the cmd of “ Node fibjs “ I get the error message:brbr“ The term node is not recognized as the name if a cmdlet ”brbrI don’t know how to setup the environment on VS to follow this video Can you make a video of how to setup environment for this video ? Or someone in the comment help ? :) Thanks Comment from : Phoenix Helicase |
 |
F Comment from : Dieynaba Ba |
 |
One of the worst unclear courses I’ve ever seen Can’t understand all of the positive people in the comments Comment from : Guy One |
 |
Amazing, didn't know how to efficiently solve fibonacci, didn't really know what time and space complexity was, never heard of dynamic programming yet I understood this super easily (I know the first problem is bar far the easiest) Comment from : NormanWasHere |
 |
Thanks, very good macro tutorial Comment from : William94 |
 |
17:14 number if levels is always 1 more than heught if tree It us by definition Please keep it clear while explaining to someone Comment from : SOUNDWAVE YT |
 |
Thank you Alvin This was a great course! Comment from : Jason Elechi |
 |
"Enter a potent pot" he predicted Alexander in elden ring Comment from : Ben Baker |
 |
I almost died but this helped me a lot, thanks Comment from : Syntyche Manda |
 |
In the howSum Is it really necessary to spread the remainerResult why not just push the value and return the array itself? Comment from : Charles |
 |
Who needs stupid university professors when you got a legend like Alvin explaining DP Very good explanation!! Comment from : Electro |
 |
Is there any syntax in Java similar to the code used at 27:25, or will I just have to add a normal HashMap parameter? Comment from : Emmett C |
 |
"cool" Comment from : Duality0077 |
 |
Overall great tutorial, appreciate it! I was bit lost when it came to defining the time-complexity of canSum, not sure if the tutor was going too fast But great effort! 👍 Comment from : Sarthak Joshi |
 |
I'm here after watching graph algo I am a data engineer and I always struggled to understand the space and time complexity, this animation is all I ever wanted This is by far the best video I watched on dynamic programming Moreover, Alvin has that charm to keep me captivated for long hours without loosing focus Keep up the great work man! Comment from : sachin sachin |
 |
I just don't know what magic you did with this video, it just completely changed the way i thought solutions and now I am able to do medium level problems like a cake walk Can't thank you enough❤ Comment from : Diksha Wali |
 |
The (0,0) at 46:57 should really be a (2,0) Comment from : Victor N |
 |
very clear and concise explanation of dynamic programming! definitely enjoyed learning it all the way to the end hope there's more tutorials like this to come Comment from : zzz |
 |
I am 45 mins in, but I had to stop to drop this comment This is hands down one of the best tutorials I've ever seen brAlvin is a true teacher I am blown away by his style I have taken paid courses on this topic, but this is the first time I am understanding what this is about I can't wait to finish this tutorialbrI am going to go for all your courses Comment from : Daniel Adetayo |
 |
2:34:00 Comment from : jilson joseph |
 |
so in the gridtraveler problem, was the key to the memo a string or and int? Comment from : Alaa Farouk |
 |
I've been following along in Python and bestSum implementation will provide a good lesson to anyone being sloppy not using copy() to capture static copies of lists If you don't do it you will run into a bunch of bad results and you can even mess up your memo dictionary by changing list values after you've entered them into the dict! Of course, you can also avoid unintended changing of values by using tuples which are immutable Comment from : Octokok |
 |
Just a question: Isn't bestSum even more optimizable? We can simply do howSum, but with the array sorted in a non-increasing order Comment from : Hardik Gupta |
 |
The best dp video there is hands down Comment from : Thai Ly |
 |
oh no it is javascript Comment from : YTScript |
 |
why tf is all your dp problems 1d array?? Comment from : HITNUT |
 |
Grateful for this video, thanks Comment from : Indian |
 |
This simplicity is what I am looking for This is right tutorial I can ever ask for !!!! Awesome collection of problems br Comment from : Vishnu Sumanth |
 |
Very good video! Thank you very much! Comment from : mona |
 |
Thanks! Comment from : Alper |
 |
A fantastically clear course Your explanations are easy to understand and to the point Just wow! Comment from : Richard Bunker |
 |
1:01:43 we check key but even more would be checking if mirror of that key exists (2,3) and (3,2) would return same ans but I guess code is calling recursive for both of these cases Comment from : Akash Melkeri |
 |
Why JavaScript?!😐 Comment from : Nur Aman |
 |
Good Comment from : IsaacBG84 |
 |
These videos are real gold Even experienced software developers should be constantly in touch with DSA and solve atleast 2 medium of 1 hard Leet Code question every day In this brutal competitve market the only way to get the next job is not based on work experience but in how quickly you can crack a compeitive coding question in the interview Sure you can say you know your MVVM pattenns, UI, Front end back END, SQLite etc to build stuff But the reality is getting the next job requires every dev to be a leetcode God This applies to mom/pop companies as well as MAANG This is the new normal embrace it or perish brOn a side note: Once you get better with DSA, you begin to enjoy the daily torture and start excelling in it Always keep the engine ready and running you never know when you will get fired from your current job Comment from : neoblackcyptron |
 |
damn Comment from : heysoymarvin |
 |
the solution for fibonacci problem is not working in leetcode i can't understand whybrcan someone explain Comment from : Anand Vijay Kumar Mangam |
 |
may god bless me get a job! Sometimes I always feel that I know everything, while sometimes I feel I know nothing Comment from : Zizhong Tian |
 |
2:17:46brI was pondering when you said we ‘only take prefixes not substrings in the middle’ why you wouldnt also need suffixes brMy conclusion is that you could also take suffixes but it provides no additional computational benefit and is actually the same as taking only prefixes Comment from : Asher Garland |
 |
The way he explained it can't be better! Many thanks Comment from : Thanh Thien Lu |
 |
The bestSum problem is actually the Coin Change problem on Leetcode Interestingly, the memoization approach is a lot slower than the tabulation approach as it doesn't pass on Leetcode, and I think it's because memoization in that case is DFS and we explore a lot more of the decision tree, than the BFS of tabulation BFS is regarded as the better way for solving shortest path problems Comment from : nw |
 |
This is the best video on DP as someone new to this field, Thank you If i have online payment method i would've contributed to your channel because you deserve it 💙 Comment from : Logarithm |
 |
Awesome video, thanks!brFor tabulation ways: instead of array we can use just integer that keeps previous index from which we came to this one Difference in this indices is a jump distance or a word from a bank Comment from : Stridemann |
 |
i was looking for something like this thank you Comment from : Vikram Balaji |
 |
Pure GOLD! Comment from : Andrzej Pauli |
 |
Fantastic video! Comment from : Rudolf Espinola |
 |
Coding for Kids |What is coding for kids? | Coding for beginners | Types of Coding |Coding Languages РѕС‚ : LearningMole Download Full Episodes | The Most Watched videos of all time |
 |
dynamic amoled 2x | dynamic amoled 2x vs dynamic amoled | dynamic amoled 2x 120hz hdr10+ РѕС‚ : Tech Duggar Download Full Episodes | The Most Watched videos of all time |
 |
Knapsack Problem using Dynamic Programming Part I | Dynamic Programming | Lec 65 | DAA РѕС‚ : CSE Guru Download Full Episodes | The Most Watched videos of all time |
 |
Greedy Algorithms Tutorial – Solve Coding Challenges РѕС‚ : freeCodeCamp.org Download Full Episodes | The Most Watched videos of all time |
 |
Husband Wife Problems - Marriage Problems - Relationship Problems - Monica Gupta РѕС‚ : Monica Gupta Download Full Episodes | The Most Watched videos of all time |
 |
Master Recursion for Coding Interviews ?| How to solve Recursion problems ? ? РѕС‚ : Knowledge Center Download Full Episodes | The Most Watched videos of all time |
 |
5 Simple Steps for Solving Dynamic Programming Problems РѕС‚ : Reducible Download Full Episodes | The Most Watched videos of all time |
 |
Mastering Dynamic Programming - How to solve any interview problem (Part 1) РѕС‚ : Tech With Nikola Download Full Episodes | The Most Watched videos of all time |
 |
Procedure Oriented Programming and Object Oriented Programming - Java Programming Tutorial РѕС‚ : Ekeeda Download Full Episodes | The Most Watched videos of all time |
 |
Fastest way to learn Python #coding #python #programming РѕС‚ : Power Couple Download Full Episodes | The Most Watched videos of all time |
