Видео

😅

Thank you for the clear explanation! The example walk-through is very helpful, and I was able to write my own solution after watching that part.

Thanks man! Just had a question that why is traversal from back of the array and why not from the start of the array plzz would be great if anyone can explain that !!!

bro please use good mic, your exolanations are insane and good. People want to study from you but unable to understand due to cracky voice. Use good mic.

Very well Explained, I had the same intuition and approach but was facing difficulty in implementation, after watching till 14:40, I was able to implement it on my own. Thanks

Thanks!!

can you please also start discussing codeforces contest solutions, specially the harder problems?

very niiice explaination.

thanks for solution of 3418 ...kahi pe bhi aisa solution nhi mila jo smjh aaye ...aapka solution was what i was thinking too ...

thank you sir but why did you reverse or did a reverse traversal is what i could not understand .... indeed this was a difficult question and it was difficult to think of its brute approach as well at first glance

Very clear and concise explanation, thanks for the tutorial.

Very good and detailed explanation, thank you for sharing. I also found few solutions with DP and Binary Search. Did you try that approach as well? Thanks again.

Good explanation. Thanks for sharing

Very good explanation bro Keep growing ❤

your soln are better than most of other but use better mic... what we can do if we have a good soln but cannot understand it and you also are putting effort in making video. use better mic brother

Super helpful!

sound is not clear.

keep making videos dear

Bhiaya i found your vdo quite helpful can you tell if there is any way where i can contact you i want to improve on dsa? Like telegram or insta?

thanks bhai

Thanks a lot sir... btw i am unable to solve DP ques how to improve it?

keep posting bhaiya

Brilliant.

good efforts, although you have a good potential but try to be more clear while delivering as you seem to be confuse sometimes

bhut ache bhai

In this piece of code if(mp.find(0)!=mp.end() && mp[0]>0){ mp[0]--; ans-=permutations(mp,n-1); } You are subtracting zero count by 1 by fixing zero at start.But what if the number is 5005 and a possible arrangement is 0055.Here there are 2 leading zeroes.So how code will work?

nice explanation man! i hope you will upload other more optimal solution for this ques

nice man!

simple and nice

nice

Bhaiya kisi ka samajh nhi aaya tha but aapka 3rd ques aa gya samajh thank You

Greta explantion bro.. also upload video for Maximum Value Sum by Placing Three Rooks II🎯🎯

bro, Great explanation ! each and every thing is crystal clear, Hoping you will continue this excellent work 💯

nice video

3rd one i am wondering how u think that logic great work bro

Please explain the algo in whiteboard with dry run

1080 not available why?

I like the shading and the output! Something you can use as an icon of a burger company! Missing burgers now. I’m supporting you ❤️