Merge intervals

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

[@vimalrajj542]

I refered many videos for this problem, but this solution was excellent and completely understood- thankyou

[@hemangkrish0734]

thank you so much for your beautiful explanation , even striver was not able to convinced me

[@yagniktalaviya2146]

One of the most descriptive solution......thankyou !!!

[@rebechkah]

Thank you so much!! Got stuck on this because I was trying to compare within the intervals instead of what was already in the answer vector :)

[@aashimehta5772]

same now i will remember incase of merging how it has to be proceeded

[@newera4225]

Thanks for this explanation.
I solved with the reverse approach (by sorting with end time).
Now i have understanding of both sides.

[@armanmansoori8926]

It really makes my interest back into dsa with ur every video✨

[@foodcourt6810]

Understood. Mam very thank you for using simple for loop over iterators ,because all youtube videos are explained in iterators. You're code is very much understandable than other videos. Please write simple code in future videos also. Also I'm very grateful for keeping this video in english. Please maintain in english ,your communication is good!

[@tausifahmad2007]

Well and concised explanation ... Great work Alisha 👏👏 keep it up.

[@sanskarjaiswal4822]

Clean and up to the point explanation!!

[@hsg15]

Didi, You are such an amazing person . You make things so crisp and clear 😊🌸

[@HARSHVARDHAN-zy5fd]

Your video explanation is one of the best...keep doing mam++;

[@girdharipatel2]

thank you so much mam . your explaination is very easy to understand.

[@abdussamad0348]

arey didi kya padati ho aap maza aagya

[@manitejach5608]

Thank you so much

[@akhilparmar7005]

best explanation to this question thank you

[@AkashGupta-hq6nj]

mam can u please share time and space complexity also in each video ? It will help analyzing problem better ,Thanks

[@rebechkah]

i think it is O(n) since we are going to visit every interval once, and the number of elements inside the interval is fixed

[@vishalpanchal2343]

@@rebechkah Here Time complexity is Nlog(N) because here we are using sort function.

[@Rizwankhan-ts3gk]

thanks sister , really so much helpful

[@pg_Nithian]

Thanks Alisha for making vidios....

[@prajwalmanojkumargawai6298]

ur explanation is too good

[@abhaythakur2597]

very nicely explained

[@tarun-prakash]

thanks akka

[@HarendraKumar-yr4gt]

Nice ma'am

[@mazinshamshad3838]

Can you please explain why you did not add this line since v[1] gets updated so v[0] should also be updated as v[0] = min(v[0], intervals[i][0]); ????

[@RohitKumar-dy2gc]

finally seems so easy to do

[@hasibulmallick4967]

Could you please make a video about your coding journey!!! from first programming to microsoft.
And also for core branch student what are the fundamental computer sub(like OS, DBMS, OOPS etc) that we should study for placement ???

[@prajwalmanojkumargawai6298]

thanks mam🧡🧡

[@himanshupanwar9588]

why we are taking &v in line no.20 instead of only v ?

[@muskancreativity7]

Can u please make a video on "Maximum area of triangle" question on interviewbit? I'm not understanding that

[@tanyasinha4102]

If I am using ans.front() in line 20,its giving error . Why?

[@probabilitycodingisfunis1]

We need to take ans.back() to get the previous interval , so that we can compare previous and current interval .

[@rishabh_pant]

8:26

[@ayush1344]

Didi nahi samaj rha hai mujhe, my vector concept is weak

[@compc_59_manishyadav77]

maam what is your full name , so that I get connected with you on linkedIn