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/aryan-0077
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
Пікірлер: 37
Segment Tree Crash Course - kzread.info/dash/bejne/gKOatKuAdZrVh7g.html When are you ready for FAANG - kzread.info/dash/bejne/mmtlupOPfdKbepM.html
@pratikshahire4403
12 күн бұрын
Hey! What's your codeforces handle?
he makes every solution very complex to undertsand
@SurajKumar-xm5fs
12 күн бұрын
very well explained and also covered the other cases as well. amazing, keep it up!
God damn the value you provide through these videos is Immeasureable, thanks a lot dude
Already done today's leetcode question
@ARYANMITTAL
12 күн бұрын
Yeah, that’s the spirit🫡❤️
kitna sahi samjhaya h .........👍👍
bro ye question IPO jaisa nahi hai almost
Feeling motivated, great explanation brother.
Bro i think for the for loop it will be i < n
How did you develop such thinking ability? Please tell.
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___
10 күн бұрын
learn how radix and counting sort works, you will get the last one ;)
Great explaination 👌👌
NICE SUPER EXCELLENT MOTIVATED
thank you.
sir can i know, why pair and vector is used instead of hashmap?
Bhaiya is "cracking the coding interview " book is worth to buy in 2024???
r..r..r..r..right!!
Maqsad nhi bhulna hai?? I'm sold brother
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
12 күн бұрын
Some minor changes in IPO code and it worked
18:32 how come O(m+n) complexity
why don't you put timeline in video
@saiei
12 күн бұрын
my man is fast in words but lazy at work, makes him suitable for manager XD
@Engineering.Wallah
12 күн бұрын
Bhai tu bhi daal sakta hai
After sorting 24,66,99 how did it become 66 99 and 24?
class Solution { public: int maxProfitAssignment(vector& difficulty, vector& profit, vector& worker) { int tprofit=0; for(int i=0;i
Used the same logic as IPO.
@milan0023
12 күн бұрын
? Que num
@manjeetyadav5830
12 күн бұрын
@@milan0023 502
@RohitKumar-hn6wj
12 күн бұрын
@@milan0023 leetcode 502