3116. Kth Smallest | Math | Inclusion Exclusion | Binary Search | Bitmasking | Bit Manipulation
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/aryan-0077
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
Пікірлер: 64
If the interviewer does not accepts my heap solution then I will just simply leave the room! Btw what a great explanation!
@CGhitaarth
3 ай бұрын
hey could you share your heap solution? ty
@bishalkundu7592
3 ай бұрын
@@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
@disunique6107
3 ай бұрын
True 😂
Not today but Someday..... Will reach such a level🙌
nice video and explanation. commenting and sharing this video to friends to increase reach .
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
@Noob_Coder1234
3 ай бұрын
is he CF expert?
@ITACHIUCHIHA-dr8sz
3 ай бұрын
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
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.
ARYAN , PLEASE EXPLAIN BIT SLOW SUCH PROBLEMS 😂 , BUT THIS EXPLAINATION IS GEM , GOD BLESS U !!
You solve these problems which no one touches. Thanks aryan for such efforts 😁
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 ✨
Great Explaination!!!! Keep up the good work!!!!
Great explanation bro .... I was searching for this explanation from contest completion 🙇🙇
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
Nice explanation love it !! 🥰🥰
Very nicely explained 👏🏻👏🏻 Deserves more reach
great explaintion. i always wait for you if i can not solve contest question.
The lecture is just amazing like always sir😍
Great Work
gajab ka solution hai
very nice explanation
Great explanation ❤
Very good explanation
@17:20 Dont get demotivated brother, you are doing great. You and striver are alike.
great explanation
subscribed, thanks for making the video
Keep up the good work bro. The explanation is subtle and profound
Nice explanation
Thanks a Lot Aryaan Sir Op
maksad nhi bhoolna was the best line 😂
Learnt bit mask and existence of LCM and GDC function
@fraserdab
3 ай бұрын
and inclusion exclusion use in programming
it would be helpful if you provide with the nodes u use to explain in vids
Thanks! :)
Thanks Bro
ONE OF THE OZEST QUESTIONS
Any bit manipulation playlist?? Any suggestions
can we take r as k*(lowest value in coins arr)
If you are in college do watch this - kzread.info/dash/bejne/iHWEmaOTgsjdc84.htmlsi=nDaD3JimS1JFxsrH
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 😅
bhaiya you explained very well but i am still lacking in the intuition part
please add link to code in description. Will be very useful
Advance version of ugly number 3 leetcode problem
I think space complexity is O(1). Correct me if Iam wrong.
Time Limit Exceeded 522 / 559 testcases passed my sol failed
@ramprasath8091
3 ай бұрын
heap?
@hhcdghjjgsdrt235
3 ай бұрын
@@ramprasath8091 something like that
7:23 maksad ni bhulna bhaiyoooo 🙂🙂
4th ki video kab aayegi
4th problem also please
Maksad nahi bhulna hai!!!!
Bro after breakup: Ahh, my ex was mid. midX it is.
the time complexity that you told is wrong. Please check it
How can a human solve this?
@ramprasath3818
3 ай бұрын
Lol
If you explain in hindi it will be more clear
2 hard this week is 😢
Kch sawal hone layak hi nhi hote
crazy solution bro🫡