502. IPO | Greedy | Priority Queue | Sorting

In this video, I'll talk about how to solve Leetcode 502. IPO | Greedy | Priority Queue | Sorting | Zeta | Salesforce | Amazon
How to balance College & CP - • How to Balance ⚖️ Codi...
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 :)
✨ Timelines✨
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

[@ARYANMITTAL]

How to balance College & CP - ua-cam.com/video/79rxV2d86ww/v-deo.html

[@shrutivvv]

Amazing explanation...pls explain like this only..❤

[@arcade320]

Please Explain like this only today i easily understand what you are trying to explain otherwise i can't get what you try mostly...please explain like this only each and every thing should be crystal clear..Thankyou Aryan

[@parthtammiwar8609]

he always explains clearly,maybe you are 😮‍💨

[@arcade320]

@@parthtammiwar8609 yeah i am dumb not smart as you , you could be a scientist in NASA in future , get lost i have't asked for your advice . BE careful from next time okay ? stupid??

[@arcade320]

@@parthtammiwar8609 shut up get lost

[@agtonybarletta]

Thank you for the video, your detailed and slow pace explanation made it much easier to understand 👍

[@funnyanimation888]

This was really easy to understand and straight to the point .Thanks a lot.

[@parthtammiwar8609]

bro can you please upload gfg potd ,it would be a great help,as your explanation skill are aweasom

[@mathy642]

Excellent approach.

[@sanebrain3083]

3:19 if you have already understood the question , the solution begins her

[@parasd2802]

thanks for this explanation, also if possible can you please share wtv you write on your screen, would just love to go through it

[@Flynn-lk8im]

What makes this different from the typical knapsack problem so that we don't apply DP?

[@6mahine_mein_google]

look at constraints

[@mohit7717]

When I am not able to solve daily leetcode POTD then I prefer your video... I have some doubt can you please answer here.. I have not learn Greedy, heap and priority queue yet .. So its good to solve daily POTD after understanding your solution or what the correct way .. Can u please suggest me?

[@namannema3349]

nice approach

[@rishiarora8123]

nicely explained man!

[@yummytoeat3433]

Please write a bit bigger. It will help us

[@GYANKIBAAT-ze7nd]

Aryan can you why can't we apply DP here?

[@6mahine_mein_google]

it will give TLE as u have to keep track of k and current capital .. TC of dp solution will be 1e14 and you can do it only after sorting the capital,profit array...
from there we got greedy solution idea

[@devahuja9052]

Hey Aryan !
Hoping you will reply to my query
When I first saw this question, I thought of the dp approach and kinda related to the reward part 2 question that recently showed up in the weekly contest 401 and you made a video solving it using bitset, can't this question be solved the same way?
Kindly guide
Moreover thankyou so much for such amazing content, keep going!

[@Vikram_Singh-d9c]

bro what is DP? and I haven't learned greedy approaches till now how to start?

[@naamnhibataunga5897]

brother can you please make a video explaining question 128..
using this solution:-
class Solution {
public:
int longestConsecutive(vector& nums) {
unordered_map m;
int r = 0;
for (int i : nums)
if (!m[i]) {
m[i] = m[i - 1] + m[i + 1] + 1;
m[i - m[i - 1]] = m[i];
m[i + m[i + 1]] = m[i];
r = max(r, m[i]);
}
return r;
}
};
i am still not able to understand it.

[@shivendrasingh8520]

bhai thoda dhire bol dete.... plz

[@shivendrasingh8520]

atleast pehle question to dhire dhire batao bhai

[@aishwaryasuresh3610]

This s such a great explanation, starting from why dp and going in the direction of dp and why we cant do dp. Incredible.

[@TON-108]

42k ❤‍🔥

[@iamnoob7593]

Aryan man , This is beautiful explanation.

[@anubhavdeepankar6681]

can we say priority queue will be of size : at max size k ? , just an observation

[@vageshnp6792]

tq

[@AnordinaryMan007]

I was thinking in the direction of profit then but capital is more important their

[@Anonymous____________A721]

Sir
Why not sorting with profit-capital value

[@prashantsahu5117]

because we will loss the indexes of profit and capital both

[@Anonymous____________A721]

@@prashantsahu5117 we can take by creating vector of pairs

[@kondekarvaishnavi2348]

since we need at least capital of w to consume a project. Inorder to make sure that we will sort based on capital profit value. If we sort the profit-capital value in descending order but how u will make sure that u will get u have that amount of capital as profit with u? so this is y we sorted capital-profit

[@harshal8781]

congo for 42k AM ♥

[@_._Harsh_._]

Excellent Explanation!