nice video and explanation. commenting and sharing this video to friends to increase reach .
@Noob_Coder12349 ай бұрын
ARYAN , PLEASE EXPLAIN BIT SLOW SUCH PROBLEMS 😂 , BUT THIS EXPLAINATION IS GEM , GOD BLESS U !!
@bishalkundu75929 ай бұрын
If the interviewer does not accepts my heap solution then I will just simply leave the room! Btw what a great explanation!
@CGhitaarth9 ай бұрын
hey could you share your heap solution? ty
@bishalkundu75929 ай бұрын
@@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
@disunique61079 ай бұрын
True 😂
@HimanshuKumar-nf4tyАй бұрын
There will be TLE with Heap solution. class Node implements Comparable{ int multiple; int curr; Node(int multiple,int curr){ this.multiple = multiple; this.curr = curr; } public int compareTo(Node a){ if(this.curr!=a.curr){ return this.curr - a.curr; } return this.multiple - a.multiple; } } class Solution { public long findKthSmallest(int[] coins, int k) { PriorityQueue pq = new PriorityQueue(); Set visited = new HashSet(); long val = 0; long curr =0; int c = k; int n= coins.length; for(int i=0;i
@nelsonthekinger9 ай бұрын
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_Coder12349 ай бұрын
is he CF expert?
@ITACHIUCHIHA-dr8sz9 ай бұрын
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
@Anonymous____________A7213 ай бұрын
@Noob_Coder1234 master
@vaibhavagarwal37579 ай бұрын
You solve these problems which no one touches. Thanks aryan for such efforts 😁
@ashisranjandey75419 ай бұрын
Now this explanation is an ART !!! and u r a great artist. Never thought will understand this much in a hard prob.
@aashutoshagrawal52399 ай бұрын
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.
@prathameshkhetre14949 ай бұрын
discovering your channel is the one of the best thing happened to me in my coding journey ✨
@ShivamYadav-vg5fv9 ай бұрын
@17:20 Dont get demotivated brother, you are doing great. You and striver are alike.
@Mihir_kathpal9 ай бұрын
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
@vishwasdhanwani61349 ай бұрын
Not today but Someday..... Will reach such a level🙌
@Anonymous____________A7213 ай бұрын
Did u😂
@HarshaVardhan-fu9kv9 ай бұрын
Great explanation bro .... I was searching for this explanation from contest completion 🙇🙇
@nobbiesid13249 ай бұрын
Nice explanation love it !! 🥰🥰
@user-em3hk3kp6r9 ай бұрын
Keep up the good work bro. The explanation is subtle and profound
@Its_Shubham_Negi2 ай бұрын
Liked !!. Op explanation ❤
@nikeshmali85069 ай бұрын
great explaintion. i always wait for you if i can not solve contest question.
@pranavrao65929 ай бұрын
Very nicely explained 👏🏻👏🏻 Deserves more reach
@wellsonny79879 ай бұрын
Great Explaination!!!! Keep up the good work!!!!
@vishwajeet1723 ай бұрын
You have just got a new subscriber
@sanskardhyani41129 ай бұрын
The lecture is just amazing like always sir😍
@tanmay56639 ай бұрын
Great Work
@ARYANMITTAL9 ай бұрын
If you are in college do watch this - kzbin.info/www/bejne/jHKzaHSQh8qqec0si=nDaD3JimS1JFxsrH
@raviprakashgupta96419 ай бұрын
gajab ka solution hai
@pabitrakb52919 ай бұрын
Great explanation ❤
@kreideprinz46469 ай бұрын
great explanation
@gauravlandge33569 ай бұрын
very nice explanation
@shivamchaudhary75749 ай бұрын
Nice explanation
@ankurprakashsrivastava77649 ай бұрын
subscribed, thanks for making the video
@ParthTagalpallewar9 ай бұрын
can we take r as k*(lowest value in coins arr)
@vinaymungra27359 ай бұрын
Thanks a Lot Aryaan Sir Op
@jatishay266 ай бұрын
maksad nhi bhoolna was the best line 😂
@fraserdab9 ай бұрын
Learnt bit mask and existence of LCM and GDC function
@fraserdab9 ай бұрын
and inclusion exclusion use in programming
@satwiktatikonda7649 ай бұрын
it would be helpful if you provide with the nodes u use to explain in vids
@disunique61079 ай бұрын
Any bit manipulation playlist?? Any suggestions
@083_tusharsachdeva69 ай бұрын
ONE OF THE OZEST QUESTIONS
@raviyadav25529 ай бұрын
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 😅
@ioanniskoutoulakis37378 ай бұрын
Thanks! :)
@harikrushnasuhagiya39259 ай бұрын
Thanks Bro
@242deepak9 ай бұрын
please add link to code in description. Will be very useful
@ashish34879 ай бұрын
bhaiya you explained very well but i am still lacking in the intuition part
@kaushikmoralwar079 ай бұрын
7:23 maksad ni bhulna bhaiyoooo 🙂🙂
@SanjayKumar-iu7rq9 ай бұрын
Advance version of ugly number 3 leetcode problem
@242deepak9 ай бұрын
the time complexity that you told is wrong. Please check it
@venkatarakesh16989 ай бұрын
I think space complexity is O(1). Correct me if Iam wrong.
@khalidalam9803 ай бұрын
I also think so. Anybody confirm please
@helloimjavauser8 ай бұрын
Maksad nahi bhulna hai!!!!
@yashkalia23119 ай бұрын
How can a human solve this?
@ramprasath38189 ай бұрын
Lol
@feelyourbeat78209 ай бұрын
4th ki video kab aayegi
@craftsworld32379 ай бұрын
4th problem also please
@hhcdghjjgsdrt2359 ай бұрын
Time Limit Exceeded 522 / 559 testcases passed my sol failed
@ramprasath80919 ай бұрын
heap?
@hhcdghjjgsdrt2359 ай бұрын
@@ramprasath8091 something like that
@242deepak9 ай бұрын
If you explain in hindi it will be more clear
@rkb_4049 ай бұрын
Bro after breakup: Ahh, my ex was mid. midX it is.