826. Most Profit Assigning Work | 5 Approaches | Greedy | Binary S | Priority Queue | 2 Pointer | DP
ฝัง
- เผยแพร่เมื่อ 16 มิ.ย. 2024
- 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
Segment Tree Crash Course - th-cam.com/video/NofRIGE7oWU/w-d-xo.html
When are you ready for FAANG - th-cam.com/video/h71X1VMo5J0/w-d-xo.html
Hey! What's your codeforces handle?
he makes every solution very complex to undertsand
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
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.
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
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
my man is fast in words but lazy at work, makes him suitable for manager XD
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.
? Que num
@@milan0023 502
@@milan0023 leetcode 502