You are doing too much hard work dude.Wish you best of luck for your future endeavours.

Can't be explained better than this... Million times thanks for making these questions so simple :)

Wonderful way of explaining the algorithm behind the program. Most channels only explain(show) the code. Please keep up this great work. Please do mostly asked Leetcode medium questions. Will be a great help. Thanks a lot.

Awesome explanation. You’re doing a great job in helping the community.

Awesome explanation! Thanks! As per the explanation, just remember this: Remove previously seen peak elem to flatten the curve. When graph dips, we have already seen a peak.

One of the best intuitions I have ever seen. I love the way you take examples to derive the logic. Keep it up. And also thanks for delivering such a quality content on coding problems. You just earned a subscriber.

wonderful video. Great explanation of code and intuition. Keep up the good work

This is absolutely mind blowing. Couldn't think of this approach.. 😭😭😭 Also so many edges cases to handle... But great great video.

Perfect, clear explanation to a problem that I've been stuck on. Thanks so much!

The explanation was really awesome bro. Gave a whole new perspective to look at numbers. Really appreciate the effort. Sincerely, thank you.

It was such a great explanation. Half way through the video and I knew what to do. Keep up the good work.

Very nice explanation better than other explanations out there which just throw terms like greedy etc. Giving concrete examples and explaining the algo through them makes it much easier to understand.

Amazing intuition explained. Thank you

Nice content. Keep on making such videos

God level explanation bro. Been watching your videos since a month and they are all brilliant. Will definitely donate once I land a job :)

I wish I could like this video more than once. Thanks for your explanation. You are good!

Sir , the way you explain is absolutely amazing !! . Wish i had a teacher like you . Greatwork Sir !! :) :)

Great explanation brother. Understood each and every step. Keep doing great work.

nice .. this is a good explanation. the good part is you are telling more examples that make more sense for everyone.

I'm so happy that I found your video. I understood it very well. Thank you very much sir.

Became fan of your explanation! Much much appreciated!

Man, wonderful explanation.. Highly appreciated.. 💞💞

Nice Explanation! Thank you 😄

Simple and perfect explanation!

This is a phenomenal explanation!!

great explaination

This is an amazing explanation! Nice question, thanks.

Beautifully explained.

Your explanations are best I have found on KZfaq.

Simply Awesome! Keep Growing!!

Pretty good explaination bro ! I was able to solve it in my mind but couldn't put it in code . DIdn't think about first-come maxima approach . Cheers (y)

Wat an explanation, absolute gem

extremly datailed explanation..thank you so much!!

Amazing stuff! Thank you.

Best concise explanation

Dude, congrats on 100K. You deserve it

good explaination

man what a brilliant explanation

good explanation

Your explanation is really good and with O(N) which is better. I solved this problem with different approach and I think the time complexity id O(N * k). Is that correct? Step 1: Parse the string left to right. Step 2: For each current char at i, See if there is a char lesser than the current char in window [i+1 to i+k]. If found, decrement the k and skip the char. Otherwise add to the result. Here is the code: public String removeKdigits(String num, int k) { if(num == null || num.length() == 0 || num.length() 0){ builder.delete(builder.length()-rem, builder.length()); } String res = builder.toString(); return res.length() == 0? "0" : res; } int getMinIndex(char val, int start, int end, String num){ if(end >= num.length()){ return -1; } for(int i = start; i

this channel should have millions of subs.

pure genius!

great job, thanks for good quality of explanation

great explanation, easy to follow and understand. thanks

Nice Explanation

thanks so much, great explanation!

great explanation

wonderfull way of explaining..

Nice and clean :)

Great Video

Thanks for clear explanation !!

Glad i got the stack approach by myself even though my code was way messier than yours ^^

nice work sir, please keep it up. Kudos

Perfect implementation !!

Great explanation sir, Thanku so much

An inspiration for anyone who wishes to learn or teach DSA

starting the day with your video

Great Explanation

Very good explanation and visualization

hey, can you please tell me about how you are wrinting are you using digital pen and which software you are using for writing

Thanks

nice explanation! keep it up :D

Thanks. I hate your 4's but the overall the video was quite helpful. I solved 402 with a different approach, but wanted to see how the stack based approach worked. No I know.

Bhai thanks alot for sharing Algo Code and Explanation

Very Well Explained sir 🔥👍🏻

Amazing 👌 explaination

amazing explanations man...

This helps alot ThankYou sir

Initially I thought this is a DP problem because I thought we have to consider all possible cases and the do the DP thing... but this approach is really wonderful.

Thank you very much!

Great approach

kya baap tarike se sikhaya bhai. Mja aagya. Thanks man

Best explanations ever

Good

Can we use butmasking to reduce complexity to o(n)

Nicely explained..

You are on fire!!!!

Thank you so much!

Amazing👌

That was amazing,

nice explanation ❤❤

Very well explained

Thank You!!

Thank You Sir!

One thing to notice here if the elements keeps on increasing as he said it will form the smallest number possible that means we will have the higer value digits at the end so we can remove them easily with the help of the stack

How does one come up with such intuitive solutions? I tried to come up with multiple solutions but was not even close to this solution. I tried to solve this question using priorityQueue, HashMaps, expanding from center of the string.

If the problem statement is reversed and we have to find the maximum number after deleting k digits, would we do the opposite by looking for where it rises instead of dips from left to right?

🔥🔥

Too Good!

thank uu

what is the time and space complexity for this solution definitely it wont be O(n*k) ?

good explanation man

I got a goodone idea to solve this say we have the number 71382 and k=2 so what we can do is that to divide the digit by its index number, index number must be starting from 0 ie for 7 index number should be 1 not 0 and so on,, then after we got the list of the divided result we can just chose the minimums possible and then we can include only those in return value, me testing this got all correct result for almost all cases

Lucid Explanation!!

Hi sir amazing explanation the method looked very nice, but i dont think it will work for numbers with trailing zeros in the end

👌

Can this be solved using some variation of knapsack , considering size =n-k , values 1 4 3 7 2 9 , as each digit may come or may not come in the solution .

Thank you....

Thanks man

Thanks man :)