Merge Overlapping Intervals | Leetcode 56 | Arrays

Topic: Arrays

Time Complexity : O(nlogn) where n is the length of the input array

Code:

Leetcode:

*Note* I claim no rights to this question. All rights belong to Leetcode. If I'm reviewing a solution that was from another Leetcode user or Leetcode itself I will give credit below.

Credit to :

Hey there! Just wanted to let you know that some of the below links in this video description are affiliate links, which means that if you make a purchase through them, I may earn a small commission. Don't worry though, it doesn't cost you anything extra and it helps support this channel so I can continue to make more videos for you. Thank you so much for your support, and as always, all opinions are my own!

[NideeshTerapalli]

Hey there! Just wanted to let you know that some of the links in this comment are affiliate links, which means that if you make a purchase through them, I may earn a small commission. Don't worry though, it doesn't cost you anything extra and it helps support this channel so I can continue to make more videos for you. Thank you so much for your support, and as always, all opinions are my own!

[bhavyashah]

Great explanation. Better than Nick White any time any day. Pls, don't stop coding on Whiteboards as this helps in clear understanding of the problem.

[ZunayedSiddiqui]

Great video with clear explanation!
Suggestions for video improvement: Maybe you can write the code on leetcode itself and screen record it with voice over or side screen with your face while solving the problem!

[ragu]

Can you make a video which does this with test driven development i.e TDD ?

[manthankhorwal]

Where it will fail if i do sorting with finishing time

[arodgzz]

I think you're missing an else the overlaps condition

[gurleenkaur]

why is t[0] not this -> Math.min(t[0], interval[0])?