Merge Intervals - Leetcode 56 - Arrays & Strings (Python)

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@scubahick]

what drawing software do you use?

[@malakggh]

miro whiteboard

[@kishc4509]

Great work! Wondering why we can't just initiate merged as merged = [intervals[0]] I feel like that's more readable and that way we don't need the "if not merged" check each time. Thanks!

[@helloworldcsofficial]

thanks! Is intervals.sort() not sufficent? and why not?

[@Jollez]

I believe because you need to sort based on the 0 index of each pair so you have to declare the comparator

[@elijahachiri]

I hated this problem. I was trying to figure out the solution without sorting and ended up with too much logic that didn’t suit all edge cases. I want to try it again without watching the rest of the video but I’ve already burned too much time

[@hamids4550]

why merge[-1]

[@Powaup]

I just couldnt figure out the need for the .max but examples like this make it necessary: intervals = [[1, 5], [2, 6], [3, 4]]

[@ImRafaelPL]

why is it your least favourite?

[@robertedwards4401]

It's my least because the test cases they give only tell 1/10th of the story.

[@Powaup]

@@robertedwards4401 they really should just give us an example that is unordered

[@dhananjayraina2478]

least favourite for a reason

[@GarouNguyen]

bro merged[-1][1] not work

[@AlgorithmDoctor]

paste your code here, we troubleshoot together

[@GarouNguyen]

@ bro do you have experience with api sql orm? I have a project using raw js and html css want to make ot work for comment part and login user