3116. Kth Smallest | Math | Inclusion Exclusion | Binary Search | Bitmasking | Bit Manipulation
ฝัง
- เผยแพร่เมื่อ 14 ต.ค. 2024
- In this video, I'll talk about how to solve Leetcode 3116. Kth Smallest Amount With Single Denomination Combination | Math | Inclusion Exclusion | Binary Search | Bitmasking | Bit Manipulation
Let's Connect:
📱Discord (Join Community) : / discord
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / ez.pz.dsa
💻 Twitter - / aryan_mittal007
🤖 Github: github.com/ary...
About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms
If the interviewer does not accepts my heap solution then I will just simply leave the room! Btw what a great explanation!
hey could you share your heap solution? ty
@@CGhitaarth I didn't implemented but I was thinking to generate the first k distinct numbers using heap. But that would have given me TLE, so I avoided that solution
True 😂
ARYAN , PLEASE EXPLAIN BIT SLOW SUCH PROBLEMS 😂 , BUT THIS EXPLAINATION IS GEM , GOD BLESS U !!
I barely can't believe what I'm witnessing, this is crazy solution, How much hardwork to reach here? 😵 This is crazy!
So this are the powers of a CF Expert! Very Impressive! Thanks for the Solution
is he CF expert?
i would recommend you try solving codeforces div2 C level problems, then these will not seem intimidating at all, even if you have to watch solution videos
@Noob_Coder1234 master
nice video and explanation. commenting and sharing this video to friends to increase reach .
If you can slow down your explanation a bit it would increase viewer's attention. Atleast for me I felt like this is a very good problem and you have gone through every approach one can think of and proving it wrong why it cant be in that way but it was too fast for a beginner or a newbie to understand this. A person who is already ranked high wouldn't easily come to yt and watch the solution instead he can go to lc solution section to refer that. So, try to make your solutions a little slow and compatible for a newbie. My personal suggestion only following you since last october.
You solve these problems which no one touches.
Thanks aryan for such efforts 😁
Not today but
Someday..... Will reach such a level🙌
Did u😂
@17:20 Dont get demotivated brother, you are doing great. You and striver are alike.
You have just got a new subscriber
Now this explanation is an ART !!! and u r a great artist. Never thought will understand this much in a hard prob.
discovering your channel is the one of the best thing happened to me in my coding journey ✨
very nice explaination bro.. you are inspiration for those who do not convey solution properly inspite of your problem of fumbling , but i salute your hardwork
great explaintion. i always wait for you if i can not solve contest question.
Very good explanation
Great explanation bro .... I was searching for this explanation from contest completion 🙇🙇
Nice explanation love it !! 🥰🥰
great explanation
The lecture is just amazing like always sir😍
Great Work
gajab ka solution hai
Very nicely explained 👏🏻👏🏻 Deserves more reach
it would be helpful if you provide with the nodes u use to explain in vids
Keep up the good work bro. The explanation is subtle and profound
Learnt bit mask and existence of LCM and GDC function
and inclusion exclusion use in programming
Great Explaination!!!! Keep up the good work!!!!
Nice explanation
maksad nhi bhoolna was the best line 😂
Great explanation ❤
subscribed, thanks for making the video
ONE OF THE OZEST QUESTIONS
Thanks a Lot Aryaan Sir Op
Any bit manipulation playlist?? Any suggestions
This is my very first vedio of solving a hard lvl problem and I learn many new concepts for the very first time, but it took me multiple times to understand the problem, and although I get the question but I feel too naive to get to the solution 😅
please add link to code in description. Will be very useful
Thanks! :)
bhaiya you explained very well but i am still lacking in the intuition part
Thanks Bro
can we take r as k*(lowest value in coins arr)
I think space complexity is O(1). Correct me if Iam wrong.
I also think so. Anybody confirm please
Maksad nahi bhulna hai!!!!
If you are in college do watch this - th-cam.com/video/VAP7AZRewCk/w-d-xo.htmlsi=nDaD3JimS1JFxsrH
7:23 maksad ni bhulna bhaiyoooo 🙂🙂
the time complexity that you told is wrong. Please check it
Advance version of ugly number 3 leetcode problem
Time Limit Exceeded
522 / 559 testcases passed
my sol failed
heap?
@@ramprasath8091 something like that
4th ki video kab aayegi
Bro after breakup: Ahh, my ex was mid. midX it is.
4th problem also please
If you explain in hindi it will be more clear
How can a human solve this?
Lol
Kch sawal hone layak hi nhi hote
2 hard this week is 😢
this is going on my suicide note
crazy solution bro🫡
very nice explanation