Minimum Cost to Hire K Workers - Leetcode 857 - Python 

Sorry I missed so many days lately. I'll be much more consistent going forward. You can count on it!

Companies asking this question in Interview ❌ Companies implementing this ✅

There's no way I can come up with this logic in an interview

3:20 "if we wanna be full capitalists" - Neetcode

*capitalists have left the conversation you can get 20 units of work for the half price (50) no, I can get 15 units for the double price (105)

What about the case when the max value that you pop from the heap is the value that you have just added, in that case would it still be valid to evaluate res using the current rate?

Thanks! Don't disappear for so long.

I think what makes this problem hard is the lack of explanation of what is happening in the question, and solutions haha

this one got me confused for days but your explanations always helps me understand every problem better.

This is somehow worse than current industry pay scaling, so expect to see this adopted next year.

I think the time complexity can be simplified as O(nlogn) since n >= k

What I learned today is being too good at your job is not necessarily going to get you a job.

When he does (10+5)*7=105 i was like 💀🤡☠️

this has to be the most convoluted explanation of K workers problem I've heard 😅

Hi Bro Are you haring ?

I am still in some kind of confusion with the code

I didn't even understand this question

Please help me with this question. I'm going to use sliding window starting from 1 to len(quality) . From heap I'm going to pop when : while heap and len(heap) > k, heapq.heappop(heap). But I don't realize how to check when I am heappush to heap?

AHH DIDNT GET IT

Who just deleted my comment?

Best explanation!

Thank you for significantly reducing the time I would have spent on the editorial

You are late man! I solved it but in different way. Keep posting. Don't break streak 😂

Best explanation !

I have tried to solve this task for 2 hours! Unreal problem!

This is very similar to a question that we ask at Disney+

very cool

Best explanation!! Thank you

Thanks man, your videos help a lot.

thanks, I did not even understand the question

i got TLE am i a failiure ?

Thank you for the best explanation ever! After the first 4-5 minutes of the video, I was able to figure out a solution on my own.

Hi navdeep, any good resource recommendations to learn how to determine space and time complexity for my own created solution? and also any website that can explains DSA terminology well?

Put my deleted comment back up.

thank you neetcode

while we are subtracting the maximum quality (since it's a maxheap) when the size of the heap becomes > k (k + 1), suppose our current quality is the maximum quality and we subtracted it from our total quality, but we are still using it's rate (which will be the maximum rate till now since rates are stored in ascending order) to get the minimum total wage by multiplying it with the total quality till now after the subtraction of the current maximum quality. basically we are multiplying the rate of that current quality with the total previous quality we already calculated an answer for. though this won't change our minimum answer till now since we are multiplying it with a greater rate, but still this is wrong. maybe we can also maintain a maximum quality and whenever we are popping the maximum quality, we won't use its rate to find the answer.

thank you king

thanks goat

Awesome explanation

how is he using his pen(whatever) to write on browser bro can someone tell me? is there any software that is smooth as he is using right now? I am open for suggestion regarding software

🥳🥳🥳

There is a problem, we are calculating total_quality * rate, but one of the individual wage might hit the wage cap and must be discarded?Can you explain sir