826. Most Profit Assigning Work | 5 Approaches | Greedy | Binary S | Priority Queue | 2 Pointer | DP

In this video, I'll talk about how to solve Leetcode 826. Most Profit Assigning Work | 5 Approaches | Binary Search | Priority Queue | 2 Pointer | DP | Greedy
Let's Connect:
📱Discord (Join Community) : / discord
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / codewitharyanbhai
💻 Twitter - / aryan_mittal007
🤖 Github: github.com/ary...
About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

[@ARYANMITTAL]

Segment Tree Crash Course - kzbin.info/www/bejne/hKDJg3x9epyijbc When are you ready for FAANG - kzbin.info/www/bejne/nmiUiWSMgtRogJI

[@pratikshahire4403]

Hey! What's your codeforces handle?

[@vaibhav7480]

God damn the value you provide through these videos is Immeasureable, thanks a lot dude

[@ritikmandal7599]

very well explained and also covered the other cases as well. amazing, keep it up!

[@sundaramagnihotri5896]

Already done today's leetcode question

[@ARYANMITTAL]

Yeah, that’s the spirit🫡❤️

[@prakhargarg4166]

why don't you put timeline in video

[@Engineering.Wallah]

Bhai tu bhi daal sakta hai

[@arnavkaul7827]

Maqsad nhi bhulna hai?? I'm sold brother

[@PulkitAgg13]

How did you develop such thinking ability? Please tell.

[@-RakeshDhilipB]

18:32 how come O(m+n) complexity

[@shivateja1499]

he makes every solution very complex to undertsand

[@SurajKumar-xm5fs]

[@vaishnaviagrawal1905]

kitna sahi samjhaya h .........👍👍

[@prathamreddy37]

After sorting 24,66,99 how did it become 66 99 and 24?

[@JIGARSINGTHAKOR-yy6qp]

Bhaiya is "cracking the coding interview " book is worth to buy in 2024???

[@ManojKumarManuSai]

Feeling motivated, great explanation brother.

[@KumarDivyanshu-k3t]

This Problem is great! Great learning though I didn't understood the dp solution ( I don't have a good grip on recursion and dp topic ) Definately comeback and try the dp solution.

[@benzene___]

learn how radix and counting sort works, you will get the last one ;)

[@vijayns1900]

sir can i know, why pair and vector is used instead of hashmap?

[@atharv1510]

class Solution { public: int maxProfitAssignment(vector& difficulty, vector& profit, vector& worker) { int tprofit=0; for(int i=0;i

[@screensipsofficial]

Great explaination 👌👌

[@ganeshjaggineni4097]

NICE SUPER EXCELLENT MOTIVATED

[@kergeysarjakin5592]

class Solution { public: int maxProfitAssignment(vector& difficulty, vector& profit, vector& worker) { int n = worker.size(); vector v(n); priority_queue pq; int ans = 0; for(int i=0;i

[@kergeysarjakin5592]

Some minor changes in IPO code and it worked

[@anuverma1486]

r..r..r..r..right!!

[@RohitKumar-hn6wj]

thank you.

[@chaitanyaamajala2582]

Bro i think for the for loop it will be i < n

[@PalakKalsi]

Used the same logic as IPO.

[@milan0023]

? Que num

[@manjeetyadav5830]

@@milan0023 502

[@RohitKumar-hn6wj]

@@milan0023 leetcode 502

[@PATNAMGNANASAI]