1383. Maximum performance of Team 🔥🔥| C++ | Leetcode June Challenge | Code + Explanation | In Hindi

preview_player
Показать описание

Please like, share and subscribe if you found the video useful. Feel free to ask in comments section if you have any doubts. :)

#leetcode
#leetcodeJuneChallenge
#interviewpreparation
Maximum performance of Team Leetcode
Maximum performance of Team C++
Maximum performance of Team C++ Hindi
Maximum performance of Team Hindi

Checkout the series: 🔥🔥🔥
LIKE | SHARE | SUBSCRIBE 🔥🔥😊
Рекомендации по теме
Комментарии
Автор

Great explanation in simplest way thanks 😀

shashanksahu
Автор

I didn't understand one thing....we had to make both sum and min(efficiency) as why didn't we sort it according to the speed, so that I can get the maximum speed

girikgarg
Автор

Clear and intuitive explaination !! Thanks !!

harshtyagi
Автор

You should not push the speed first into min_heap, because if the current speed is the minimum you will subtract it from the sum in next step. Current speed must be added to the sum. Ps :- show your code acceptance at the end of the video.

lakshaygoel
Автор

How do you proof such questions . I mean we all understand the solution but why it will always work and will never fail ?

alienx
Автор

Instead of sorting it in descending order, you could have sorted that in ascending order. In that case, we could have started the traversal from the beginning. Nice solution btw.

thegreekgoat
join shbcf.ru