People only love to listen 1 Roadmap for first year. 2 Roadmap for last year. 3 How to improve DSA. And bla bla bla.... Main thing is that.. Question se hoga gyan ki batoo se nhi. Keep dowing ur good work. My ranking has been improved much bcoz of u only
@techdose4u3 жыл бұрын
😅
@madhav34443 жыл бұрын
he just roasted the excuse makers
@buzzfeedRED3 жыл бұрын
@@techdose4u :at 9:11 , if we have NO Coin annd Amt > 0: Then we shoul return -1. Isn't it? why we return Infinity?
@dhruvpurwar66423 жыл бұрын
@@buzzfeedRED since we are taking min at each point , it will give result -1 even for valid points.. That's why we take INT_MAX wherever we use min
@AYJ959 Жыл бұрын
Yeah you are right buddy
@VikasSingh-yw3lp2 жыл бұрын
never have i seen this much to the point solution and explanation ever before!
@Cloud-5772 жыл бұрын
I was really scared to approach dp questions but you saved me with this playlist. Thank you!
@TejusNataraju3 жыл бұрын
Excellent explanation and kudos to the efforts! Keep going TECHDOSE :)
@techdose4u3 жыл бұрын
Thanks
@vishalplayzz2580 Жыл бұрын
thanks a lot man !! i only search for techdose and striver for leetcode problems keep up the good work
@aakashgoswami23563 жыл бұрын
Legend is back again.....
@techdose4u3 жыл бұрын
😂
@SurajYadav-bc5id3 жыл бұрын
too much high quality content. Loved it 3🔥🔥🔥
@techdose4u3 жыл бұрын
Thanks :)
@satyam29213 жыл бұрын
Thankyou, thankyou very much 🙌, I was really struggling to solve this
@techdose4u3 жыл бұрын
Welcome :)
@ajaypatidar2 жыл бұрын
Thank you sir, finally i learn this method after watching this
@himansuranjanmallick163 жыл бұрын
Finally done😍, thanks sir for this selfless things.
@arvindg5533 жыл бұрын
1 feedback Quality of video is Gold One thing is that main logic of program is not pressured Here include coin as many times as we want until available so 'i' remains 'i' this i can get it after so long time But beginner might not So please repeat main logic more than one time
@techdose4u3 жыл бұрын
👍🏼
@arvindg5533 жыл бұрын
@@techdose4u Reply from you is making joy and happy Love you TECH DOSE from Bangalore Actually my entire class is being crazy with this channel ❤️
@techdose4u3 жыл бұрын
Great. Let's meet sometime. I am in bangalore too. I would like to meet your entire class 😜
@anshuofficial166 Жыл бұрын
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
@buzzfeedRED3 жыл бұрын
:at 9:11 , if we have NO Coin annd Amt > 0: Then we shoul return -1. Isn't it? why we return Infinity?
@johnademola5283 жыл бұрын
This solution is superb. Though, I tried running it for some Test cases and it failed. E. g Test Case coins = [2] and amount =3 failed. I changed this dp[n][amount] > Math.Pow(10, 5) ? -1 : graph[n][amount] to dp[n][amount] >= Math.Pow(10, 5) ? -1 : graph[n][amount] and it worked
@techdose4u3 жыл бұрын
Nice :)
@johnademola5283 жыл бұрын
Thank you
@techdose4u3 жыл бұрын
@@johnademola528 welcome :)
@SatishKumar-nh1oq3 жыл бұрын
Thank you. I was struggling for this edge case.
@johnademola5283 жыл бұрын
@@SatishKumar-nh1oq you are welcome
@vairamuthu27483 жыл бұрын
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 ?.
@princeanthony85252 жыл бұрын
Why is the first row Infinity and NOT Zero. Not possible is same as Zero correct ?
@pranayprasad503 жыл бұрын
Nice explanation sir, But if you work on your voice modulation it will be more fun because the pitch of the voice is constant so I was feeling a bit sleepy 😅, But really it was a good video 😊.
@intunewithishan53863 жыл бұрын
How this testcase's expected answer is 20? Which combination of coins would make the amount 6249? [186,419,83,408]
@virendranaik18933 жыл бұрын
well ..did u get the answer?
@intunewithishan53863 жыл бұрын
@@virendranaik1893 no . Not yet
@justanaverageguy47393 жыл бұрын
I think it can still be optimized. We can reduce the space by using 1D array
@techdose4u3 жыл бұрын
👍🏼
@mohansurendar74292 жыл бұрын
But, how bro?
@demokraken Жыл бұрын
so, the video is 23 minutes long. With existing pictures and code... On interview it is assumed that a candidate 1. Understands the problem 2. Comes up with the right solution (never seen it before, right?) 3. Produces correct code along with entertaining an interviewer with comments on every step as this process is not stressful enough already! How realistic is this for an hour timeframe?
@starc7014 жыл бұрын
interleaving-strings sir, this question always freak me out , i never get how it works.
@techdose4u4 жыл бұрын
Okay
@abhinavkumar63442 жыл бұрын
tooo nice way of explaination
@prashantverma78433 жыл бұрын
well explained as compare to others clears all my doubts
@techdose4u3 жыл бұрын
Nice
@ankitkumarmishra51983 жыл бұрын
memozized code for the above problem: #include using namespace std; int coinChange(int index,int sum,vector& s,int n,vector&dp){ if(sum==0) return 1; if(index>=n||sum < 0) return 0; if(dp[index][sum]!=-1) return dp[index][sum]; if(s[index]>n>>sum; vector s; s.resize(n); for(auto &i:s) cin>>i; vector dp(n,vector(sum+1,-1)); cout
@sirasanihemaspandana73903 жыл бұрын
Sir is it possible to solve with out using dynamic programming Coins= list(map(int,input(). split ())) Coins.sort() Count=0 amount= int( input ()) for I in range( Len(coins)): temp = amount dividecoin = amount//coins[-i] amount= amount-coins[-i]*dividecoin if( temp ~= amount): count+=1 if( amount== 0): Print (count) break else: Print ("-1") Sir will it work ? Could you please check?
@sirasanihemaspandana73903 жыл бұрын
Count += dividecoin
@gvnchandra2 жыл бұрын
wonderful explanation, thank you sir.
@dhanashreegodase44453 жыл бұрын
COULD NOT UNDERSTAND HOW U R FILLING TABLE FOR ACH PROBLEM
@techdose4u3 жыл бұрын
??
@manishthapa88603 жыл бұрын
very nice explanation
@RakeshKumar-yh7ro2 жыл бұрын
Great explanation thank you
@techdose4u2 жыл бұрын
Welcome 😀
@amitavamozumder733 жыл бұрын
Please make a video where we can output the path we took to reach min no of coins, do we need to maintain an array for each cell? or can we just have an extra flag like inclusion or exclusion on each cell and count from that?
@amitavamozumder733 жыл бұрын
nevermind figured it out, we just need a boolean value in each cell, showing, included or not, then we can backtrack using the same logic.
@0anant04 жыл бұрын
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?
@techdose4u4 жыл бұрын
Initializing before will be better because no of comparisons will decrease.
@mdarifnufqqdugir32782 жыл бұрын
Best explanation ❤️❤️
@revanth64763 жыл бұрын
cl = list(map(int, input().split())) tar = int(input()) sum=0 c=0 i=0 cl.sort(reverse=True) while sum
@camilocuervo82713 жыл бұрын
How can I know the coins, I mean, how many of each one according to the table
@techdose4u3 жыл бұрын
You need to store that information separately.
@camilocuervo82713 жыл бұрын
@@techdose4u Do you have any idea of how?
@sirasanihemaspandana73903 жыл бұрын
Great Explanation Sir 👌👌
@abhinavreddy10833 жыл бұрын
good explanation .... thank you
@techdose4u3 жыл бұрын
Welcome
@xyzpqr72823 жыл бұрын
[186,419,83,408] 6249 Doesn't work for this test case 😶 ???
@Aks-473 жыл бұрын
have a look at this code. int coinChange(vector& coins, int amount) { int target=amount; long int dp[coins.size()+1][target+1]; for(int i=0;i
@xyzpqr72823 жыл бұрын
@@Aks-47 I have written exactly the same code in java but don't know why it's not working for this test case only.
@Aks-473 жыл бұрын
@@xyzpqr7282 bhai if you have copied what he said, either take long int in cpp or make int max - 1, idk about java :(.. Check leetcode solutions then :)
@shaikhnabeel64433 жыл бұрын
me watching the colourful sentences : 👁👄👁 then watching it again because i didn't focused on explanation🥴
@techdose4u3 жыл бұрын
😂
@rahulbhatija16803 жыл бұрын
Thanks, dude! It helped.
@techdose4u3 жыл бұрын
Welcome :)
@syedkaja20454 жыл бұрын
what are the base cases for recursive solution
@techdose4u4 жыл бұрын
Both recursion and DP have same base cases. I showed it.
@dhruvpurwar66423 жыл бұрын
@@techdose4u a base case of val
@ayyappahemanth71344 жыл бұрын
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!
@techdose4u4 жыл бұрын
25 mins is normal for DP 😅
@ayyappahemanth71344 жыл бұрын
@@techdose4u Can't say no but try!
@vishalvikram86373 жыл бұрын
He consider every level students. From pro to noob. So its ok.
@AbhishekSingh-fo9nv3 жыл бұрын
watch at 1.25x or 1.50x
@TejusNataraju3 жыл бұрын
@@AbhishekSingh-fo9nv true !!!!!
@abhiramnatarajan80933 жыл бұрын
Well explained!
@techdose4u3 жыл бұрын
Thanks :)
@ajitheshgupta30172 жыл бұрын
Can someone please explain that j-coins[i-1]
@sushantkumar49173 жыл бұрын
bht confusing 😐
@arindam1249 Жыл бұрын
best
@pendyalaabhishek88663 жыл бұрын
can any one tell me memoized approach.
@mwshubham3 жыл бұрын
Thank you :)
@syedkaja20454 жыл бұрын
superb!!!
@techdose4u4 жыл бұрын
Thanks
@utkarshpanwar23584 жыл бұрын
please upload the video of z algorithm
@techdose4u4 жыл бұрын
Sure
@utkarshpanwar23584 жыл бұрын
@@techdose4u and please specify the difference b/w normal z algorirhm and improved version which having two intervals l and r how this is optimised then normal or without interval z algo thanks
@tanveer.shaikh3 жыл бұрын
We could have sort the array and start picking and increamenting the count
@flymaster283 жыл бұрын
That would be a greedy approach and wouldn't work in cases like: coins=[3,4,5] with amount=11. The returned value would be -1 since you would take 2 5s and be at 10, even though you can solve it by picking 4,4,3.
@mahipalsingh-yo4jt4 жыл бұрын
first comment !!!!!!!!!!!
@techdose4u4 жыл бұрын
Great :)
@267praveen3 жыл бұрын
And a totally useless one !!!
@pragyakalyanammaitrai49333 жыл бұрын
if no coins && amt>0 why we use infinity why we are not using 0 instead of inf @TECH DOSE
@snehabaser31553 жыл бұрын
Because in all prev case we use max condition. Here we wanna find min no of coins. And here if we fill 0 then min is always 0 . Hope u understand :)
@tanayshah2753 жыл бұрын
Posting recursive solution just in case if anyone wants to take a look def min_coin_required(self, coins, m, n): if n < 0 and m > 0: return maxsize if m == 0: return 0 if coins[n] > m: return self.min_coin_required(coins, m, n - 1) return min(1 + self.min_coin_required(coins, m - coins[n], n), self.min_coin_required(coins, m, n - 1)) def coinChange(self, coins: List[int], amount: int) -> int: ans = self.min_coin_required(coins, amount, len(coins) - 1) return -1 if ans == maxsize else ans