Maximum Performance of a Team - Leetcode 1383 - Python 

🚀 neetcode.io/ - 25% OFF LAUNCH SALE

I've got my Amazon final interview next Friday and I just wanted to let you know that I wouldn't have made it nearly as far without you. Thank you for all your videos! You have no idea how many lives you're changing

Thanks!

I think it would be great if you could just show us the code for the brute force way also and then go in depth to explain the optimal solution like you usually do. I personally struggle to sometimes code up even the brute force solution so learning how to do that is something I would value a lot.

To think I once hated dsa coding, have come a long way loving it now, all thanks to you ❤.

I can easily code just after half the video , he explains really good

I also used heap, got to keep the daily streak going! Thanks for the explanation!

Fan of your amazing videos! Please keep adding more and more

Thank you, this is such a subtle explanation, loved it.

You deserve 1 Mil Subscribers! 🤙

This guy can make hard question to easy, keep it up.

although i use C++, this is very well explained!!

Amazing! Elegant use of the Heap! 🙂

The explanation was great, but I do have a question, is it not better to pop the minimum speed from the heap only if the current speed is greater than that minimum speed?

2 minutes into the explanation I got the idea, thanks for the video!

Great explanation, thanks!

Lets say if we sort the array in increasing order of their efficiency then we need two nested for loops right? Correct me if my understanding is wrong

Beautiful explanation !!✨

Isn't size of The Decision Tree be greater than 2^n ?? , as 2^n would be the maximum number of nodes present itself on last level ? (Just asking for sake of my understanding regarding that Exponential Complexity, else I understand the approach totally )

Thanks for another great video! I have a question about line 11 and 12, At 14:10, when we pop the minimum value from the heap, shouldn't we first check if this minimum speed is less than the current speed i.e. spd? e.g let's say our K=1 and sorted array is like this [[10, 10], [10, 5], [10, 0]], then we should simply keep the first element as we go through the array without popping the heap.

Great. Part of neetcode community. :)

we are popping when len(heap)==k in heap and adding curr value in heap..what if the current value is smaller than what we had popped?

can you do yesterdays daily? I'm so confused trying to track the dp array. Or buy and sell stock 3 is good too

excellent explanation!

amazing explanation, thank u

Oh spot...super clean explanation!!

love from india !!! amazing explanation !!!!

awesome video :) helped me alot

Shouldn't it be 'second *largest* value' instead of 'second smallest value' at 4:48?

hello, your videos are so impressive, could you just upload the leetcode 526, beautiful arrangement? I really appreciate it.

I copied and pasted a lot of stuff and stitched together this code, but I have no idea how it works lol. I knew this could be done with bit manipulation but this method is not any better than the binary search solution, but I still wanted to try it. However, I have no idea how this works except for the msb calculation, which i modified to include (the original did not work). import math class Solution: def mySqrt(self, x: int) -> int: msb = len(str(bin(x))) a = 1 = 1 return result

awesome video.. but its more of python stuff this time.. thinking of how to do it in java.

very well explained

I had to watch the video until I saw: sort and which heap to use, after that I was able to solve the problem myself, but it took me 2 hrs, I am gonna cry :D

Amazing!

I think you should teach python for dsa

Same question. 2542. Maximum Subsequence Score

how to think of this question?

Thank you

Is a 0-1 Knapsack solution not possible for this? I was trying to achieve that, but was getting Wrong answer on submit.

amazing.

Can you do Leet Code 443 String Compression?

Hi NeetCode, can you help with 2407. Longest Increasing Subsequence II in the contest this morning? Thanks a lot!

If u get time can you please make and upload the solution for latest weekly contest last ques(2407. Longest Increasing Subsequence II). Thanks in advance 😇

AMAZING

I have been trying to find you on google internal, but can not find you haha. Please give me a clue

pleeease use snake_case in python ;(

Didn't understand the problem statement at all. Ty for explaining in a simple manner. Also for better readability eng= [[e,s] for e,s in zip(efficiency,speed)]

can someone provide java solution ?

one liner: engineers = sorted(zip(efficiency, speed), reverse=True)

Thanks for the intution, I solved this using 2 Priority queues int maxPerformance(int n, vector& speed, vector& eff, int k) { int mod=1e9+7; priority_queue pq; for(int i=0;ik){ sum-=minheap.top(); minheap.pop(); } res=max(res,pq.top().first*sum); pq.pop(); } return res%mod; }

can someone help in my java code? Some test cases are not getting passed.Thank you. class Solution { public int maxPerformance(int n, int[] speed, int[] efficiency, int k) { int[][] zip = new int[speed.length][2]; //eff,speed for(int i = 0; i < speed.length; i++){ zip[i] = new int[] {efficiency[i], speed[i]}; } Arrays.sort(zip, (a,b) -> Integer.compare(b[0], a[0])); Queue minHeap = new PriorityQueue((a,b) -> Integer.compare(a,b)); int res = 0; int totalSpeed = 0; for(int[] pair : zip){ if(minHeap.size() == k){ totalSpeed -= minHeap.poll(); } int eff = pair[0], spd = pair[1]; minHeap.add(spd); totalSpeed += spd; res = Math.max(res, totalSpeed*eff); } return (int)(res % (Math.pow(10,9) + 7)); } }