AMOUNT OF NEW AREA PAINTED EACH DAY | LEETCODE # 2158 | PYTHON SIMPLE SOLUTION

In this video we are solving a tricky Google interview question: Amount of New Area Painted Each Day (Leetcode # 2158).
On paper this question looks really easy and it's super simple to draw out a solution that works but putting it into code is much harder. There are some solutions out there that deal with Red-Black trees/Segment Trees but on this channel we opt for simpler, easier to understand solutions instead of the esoteric stuff.

[@koeber99]

the time complexity is worst. As example n = 2. [0,100000000],[0,100000000]. The time would be O(n*m), where m is 100000000 m= avg range of start to end. Simply, using an boolean array or Set<Integer> would also get me O(n*M) solution.

[@MinhNguyen-lz1pg]

Love the approach! Just a quick comment on his optimization and why does this help with the run time.

[@tsaregrad]

How this is better than the suggested solution in hints? Still N^2 for time. And for space it's actually O(5 * 10^4) for space

[@sharathkumar1576]

Thanks a lot. Your videos make me feel like I'm stepping closer to Google my dream company. Keep making these videos 😀😀. Not even my classmates helped me during college but you are doing it. Thanks a lot man you are God 💞

[@yunaf4609]

Great explanation! this problem really had me stumped from the discuss section, but your explanation was excellent. Thanks for making this.

[@jataman123]

Thanks for this explanation. I implemented it in a similar way, but it fails one last performance test. Can you spot any mistakes?

[@agnilasmagicland9672]

Very clever. Thank you for the solution.

[@keerthivasan9548]

Is Sorting by start time and overlapping intervals kind of solution works?

[@subee128]

Thank you so much

[@roywastaken]

make more videos bro, you're underrated af

[@ppavantiwari]

This will result into TLE