| Название | : | Coin Change Problem | Dynamic Programming | Leetcode #322 | Unbounded Knapsack |
| Продолжительность | : | 23.21 |
| Дата публикации | : | |
| Просмотров | : | 94 rb |
 |
Can you make a video for a range of data types, which to use when, like I was using INT_MAX but it gave me the wrong answer, but when I use 1e5 I give me the correct answer Comment from : Anshu official |
 |
best Comment from : Arindam |
 |
so, the video is 23 minutes long With existing pictures and code brOn interview it is assumed that a candidate br1 Understands the problembr2 Comes up with the right solution (never seen it before, right?)br3 Produces correct code along with entertaining an interviewer with comments on every step as this process is not stressful enough already!brHow realistic is this for an hour timeframe? Comment from : Alex |
 |
thanks a lot man !! i only search for techdose and striver for leetcode problems keep up the good work Comment from : Vishalplayzz |
 |
tooo nice way of explaination Comment from : ABHINAV KUMAR |
 |
Thank you sir, finally i learn this method after watching this Comment from : Ajay Patidar |
 |
Why is the first row Infinity and NOT Zero Not possible is same as Zero correct ? Comment from : Prince Anthony |
 |
Can someone please explain that j-coins[i-1] Comment from : Ajithesh Gupta |
 |
Best explanation ❤️❤️ Comment from : Md Arif nUFqqdUgIr |
 |
I was really scared to approach dp questions but you saved me with this playlist Thank you! Comment from : Azealia |
 |
wonderful explanation, thank you sir Comment from : Chandra Gunda |
 |
Great explanation thank you Comment from : Rakesh Kumar |
 |
never have i seen this much to the point solution and explanation ever before! Comment from : Vikas Singh |
 |
can any one tell me memoized approach Comment from : Pendyala Abhishek |
 |
bht confusing 😐 Comment from : Sushant kumar |
 |
very nice explanation Comment from : Manish Thapa |
 |
Thank you :) Comment from : Shubham Agarwal |
 |
while considering coin 2 , we can expect some minimization on previously considered coin such as 1 , why are we not considering that what is the reason ? Comment from : Vaira Muthu |
 |
Finally done😍, thanks sir for this selfless things Comment from : Himansu Ranjan Mallick |
 |
Thankyou, thankyou very much 🙌,brI was really struggling to solve this Comment from : SATYAM |
 |
1 feedbackbrQuality of video is GoldbrOne thing is that main logic of program is not pressuredbrHere include coin as many times as we want until available so 'i' remains 'i' this i can get it after so long timebrBut beginner might notbrSo please repeat main logic more than one time Comment from : Arvind G |
 |
I think it can still be optimized We can reduce the space by using 1D array Comment from : Just an Average Guy |
 |
We could have sort the array and start picking and increamenting the count Comment from : tanveer shaikh |
 |
COULD NOT UNDERSTAND HOW U R FILLING TABLE FOR ACH PROBLEM Comment from : DHANASHREE GODASE |
 |
well explained as compare to others clears all my doubts Comment from : Prashant Verma |
 |
[186,419,83,408]
br6249brbrDoesn't work for this test case 😶 ??? Comment from : Xyz Pqr |
 |
good explanation thank you Comment from : Abhinav Reddy |
 |
Great Explanation Sir 👌👌 Comment from : SIRASANI HEMASPANDANA |
 |
if no coins && amt>0 why we use infinity why we are not using 0 instead of inf @TECH DOSE Comment from : pragya kalyanam maitrai |
 |
too much high quality content Loved it 3🔥🔥🔥 Comment from : Suraj Yadav |
 |
Thanks, dude!brIt helped Comment from : Rahul Bhatija |
 |
Well explained! Comment from : Abhiram Natarajan |
 |
How can I know the coins, I mean, how many of each one according to the table Comment from : Camilo Cuervo |
 |
How this testcase's expected answer is 20? Which combination of coins would make the amount 6249?br[186,419,83,408] Comment from : Intune with Ishan |
 |
Excellent explanation and kudos to the efforts! Keep going TECHDOSE :) Comment from : Tejus Nataraju |
 |
People only love to listen br1 Roadmap for first yearbr2 Roadmap for last yearbr3 How to improve DSAbrAnd bla bla blabrMain thing is thatbrQuestion se hoga gyan ki batoo se nhibrbrKeep dowing ur good workbr My ranking has been improved much bcoz of u only Comment from : VISHAL VIKRAM |
 |
Legend is back again Comment from : Aakash Goswami |
 |
what are the base cases for recursive solution Comment from : Syed Kaja |
|
|
superb!!! Comment from : Syed Kaja |
 |
Content was really good but straight 25 mins is somewhat overwhelming for me! But content was great, if upossible cut down the time of each video! but the content was really great! Comment from : Ayyappa Hemanth |
 |
interleaving-strings sir, this question always freak me out , i never get how it works Comment from : star c |
 |
Very nice explanation! In your code, you have initialized dp 'as we go' What is a better way: initialize dp before the loops (special cases for row zero, col zero, etc) or as you have done here? Comment from : 0anant0 |
 |
please upload the video of z algorithm Comment from : utkarsh panwar |
 |
first comment !!!!!!!!!!! Comment from : mahipal singh |
 |
Coin Change 2 - Dynamic Programming Unbounded Knapsack - Leetcode 518 - Python РѕС‚ : NeetCode Download Full Episodes | The Most Watched videos of all time |
 |
Coin Change - Dynamic Programming Bottom Up - Leetcode 322 РѕС‚ : NeetCode 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 |
 |
Total Unique Ways To Make Change - Dynamic Programming ("Coin Change 2" on LeetCode) РѕС‚ : Back To Back SWE Download Full Episodes | The Most Watched videos of all time |
 |
Dynamic Programming ?| Coin Change Problem Leetcode | C++ | Java | DSA-One Course #86 РѕС‚ : Anuj Bhaiya Download Full Episodes | The Most Watched videos of all time |
 |
Coin Change 2 | Dynamic programming | Leetcode #518 РѕС‚ : Techdose Download Full Episodes | The Most Watched videos of all time |
 |
Coin Change Combination Problem Dynamic Programming Explained | Coin Change Minimum Number of Coins РѕС‚ : Pepcoding 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 |
 |
0/1 Knapsack problem | Dynamic Programming РѕС‚ : WilliamFiset Download Full Episodes | The Most Watched videos of all time |
 |
0-1 Knapsack Problem (Dynamic Programming) РѕС‚ : CS Dojo Download Full Episodes | The Most Watched videos of all time |
