I have a deep respect for this channel. Reasons - Quality over Quantity. - Focuses on creating a strong base which will help solve other different problem of the same type. - Visualize the Problem.
this comment was so reasonably complete that I can't comment anything else 😁 totally agreed, also the visualization part is helping people with picture memory like me understand and learn faster. 😎 keep up the good work 😍😍 Love from instagram 💛💚💙💜
What a concise explanation and awesome pictures. This is why I sort the TH-cam results in upload date order. The TH-cam's algorithm doesn't offer the hot new jewels like this. Great work. Gracias amigo 🤙
Nope because dp[i][j] is mat[i][j] + the min between dp[i-1][j] and dp[i][j-1], the top and left cells in dp matrix. So dp[1][1] is mat[1][1], which is 19, + the minimum between 5 and 9, and 19+5 is 24
Everywhere in the dp problems First they start explanaining the subproblems without any code with just theory After that they directly move on to the formula which will be used in problem No one is explaining in the following steps: 1. Writing code for divide and conquer 2. Next adding memoization to that code 3. Making that recursive code as itervative Can you please explain the dp problems according to above steps , so everyone can understand easily and solve the any dp problem easily..🙏
i don't want to be overly critical, because I like the subject matter, but I do have problems with your accent. I had to watch some bits four times to get what you are saying.
![A Deep Understanding of Dynamic Programming [Intro / Overview]](http://i.ytimg.com/vi/Clp5c7HvLqs/mqdefault.jpg)
I have a deep respect for this channel.
Reasons
- Quality over Quantity.
- Focuses on creating a strong base which will help solve other different problem of the same type.
- Visualize the Problem.
Oh thanks for your comment!
this comment was so reasonably complete that I can't comment anything else 😁
totally agreed, also the visualization part is helping people with picture memory like me understand and learn faster. 😎
keep up the good work 😍😍 Love from instagram 💛💚💙💜
What a concise explanation and awesome pictures. This is why I sort the TH-cam results in upload date order. The TH-cam's algorithm doesn't offer the hot new jewels like this. Great work. Gracias amigo 🤙
Thanks for your comment man!
I love DP, just solved a problem (minimum cost path) today that I couldn't solve before, like a month. Now I am in love with DP
Amazing!
This channel is great. Thanks for making such concepts
Glad you enjoy it!
brilliant as usual!
THANKS ALOT!!
4:40 why is dp =[0]*(n+1)?
Where did the n+1 come from?
because we want to store fib(0), fib(1),..., fib(n), and from 0 to n inclusive there are n+1 integers
This was Amazing video..
Please make a video on thinking of DP solution for a problem if it can be applied.
Thanks!
I'm actually making a course on DP that will be released in July
Please do a video on sliding window technique..
At 9:13, the cell [1,1] should be 21 rather than 24 right?
Nope because dp[i][j] is mat[i][j] + the min between dp[i-1][j] and dp[i][j-1], the top and left cells in dp matrix. So dp[1][1] is mat[1][1], which is 19, + the minimum between 5 and 9, and 19+5 is 24
nice video, and excellent way of explaining what is dynamic programming
Thanks!
Thanks ,you cleared all my doubts❤️
You're welcome!
I would like u to talk more about Dynamic Programming, its a good topic and hard, there aren`t too much content of it on Ytube.
Okay!
You're doing a great job brother👍🏻
Thanks!
Wow this channel is so amazing
Thanks!
Very good explanation 👏
Thanks!
please make seprate course on udemy for Dynamic Programming (algorithms) with atleast 50 problems your teaching style is just awesome
I'm actually making it, I'll try to release it by the end of June, it will contain 20 practice problems
@@insidecode oh that's great I recently purchased your top 50 coding interview questions course on udemy it's awesome ..
happy to hear that! can you please put a review on the platform?
@@insidecode yes definitely 👍
Thanks!
Everywhere in the dp problems
First they start explanaining the subproblems without any code with just theory
After that they directly move on to the formula which will be used in problem
No one is explaining in the following steps:
1. Writing code for divide and conquer
2. Next adding memoization to that code
3. Making that recursive code as itervative
Can you please explain the dp problems according to above steps , so everyone can understand easily and solve the any dp problem easily..🙏
Thanks for your comment!
@@insidecode Expecting more from you sir🤩🙏
Tq
Make in-depth videos on backtracking/recursion please :/
I published a whole 3 hours video on recursion recently xd go check it
@@insidecode 👀 thanks man!
You're welcome!
Incredible videos and Udemy content! Are you making more Udemy courses?
Thanks for the comment!
Yes a course on dynamic programming is coming at the end of the month
@@insidecode Perfect! I will be buying this! Love your material!
Thanks a lot!
Need Miscellaneous problem solving for real world!!
i don't want to be overly critical, because I like the subject matter, but I do have problems with your accent. I had to watch some bits four times to get what you are saying.
Thanks! I'll try to work on that