Відео

great solution but wish you explained it more

Hey, What do you do now? I am looking for a new job opportunity, gotta grind on leetcode. How would you do it if you were me?

Thank you for simple Explanation.

Great video solution thank you

super

worst problem in leetcode

Do you have a list of topics for competitive programming where minimum prerequisites are required?

No.238 link in the Google sheet turn out to be this vedio....

amazing breakdown

If we’re putting all the transactions in hashmap in the first for loop, then in the 2nd for loop when we’re going through all the transactions, wouldn’t we see the same transaction at both places and time will be the same too and so it will be within the 60 minute window since you put <= sign and not <. And all the transactions would be invalid by default due to that?

your approach is pretty good but it's effectively the same as sorting all intervals initially which would have a time complexity (TC) of O((n×m)log(n×m)) during heap initialization, you are pushing all intervals into the heap. this costs n×m intervals in total where n is # of employees & m is the # of intervals inserting each one into the heap takes O(log(n×m)) time. The total time to insert all intervals would be O(n×mlog(n×m)). heap Ops: after heap is initialized with all intervals, you still need to pop each interval one by one and merge them. each pop op takes O(log(n×m)), and you need to do this for all n×m intervals, so the total time for this step is also O(n×mlog(n×m)) an optimized approach would be to push the first interval of each employee and then push the next interval dynamically as we process. this minimizes heap size to n (the # of employees). this approach effectively reduces to Merging K Sorted Lists that has a TC of O(n×mlogn) which is better than O(n×mlog(n×m))

time complexity will be O(n^2)

Thanks bro. Really worked.

I really appreciate your work , I guess you didn't insert this video link(386.Lexicographical Numbers) in English Google Spread Sheet. Make sure you update and advance in thanks :)

Bro you explain too fast . But good explanation. Can you upload video of every Daily Leetcode question?

Are you XT who works in Google?

Are you chinese?

You Hardwork will Never get wasted , Your Well Deserving

Not able to understand time and space comllexity

Hey, just wanted to say this video really helped, I hope that you become the top result/answer for this problem.

Can I give you a testcase where this fails?

Old solution: ua-cam.com/video/uwMrZ_z4LIg/v-deo.html (audio issue)

Excellent explanation...

thanks for solution... can we have another solution too whose time complexity will be lesser than this ???

Thank you...approach was easy to understand

Awesome explanation!!!

Thank you 😊

Good Effort, please keep it up.

i did'nt understand the for each loop here, can you explain

Very cool technique. Thank you :-)

U could provide a link to the codebase or preferably give the code in the comments. :)

Bruteforce method and 5 ms runtime :(

thanks a lot!

If you are making video of something , shouldn't you be clear and well heard . additionally you should pronounce words properly .just a feedback after watching your video

Good Approach💯

Thank you for the code and the explanation. Keep up the good work.

Best Explaination

thank you man :)

Dude, thanks!

NICE SUPER EXCELLENT MOTIVATED

Bro's cooking very quiet in silence

those keyboard clicks are so irritating

Thank you bhaiya, it is very helpful 😊

❤me too lol

similar question: ua-cam.com/video/hwgZAy8oRRk/v-deo.html

similar question: ua-cam.com/video/HVBxIP1zcPY/v-deo.html

the old video can be accessed through here: ua-cam.com/video/rtkAsSUjpQ0/v-deo.html However, youtube currently disable people to view it report: ua-cam.com/users/postUgkxRzAU91_3AwBrjd3otZb0lrKsueNfbiac

nice explanation!

Bro get a decent mic