klee's algorithm | Length of union of line segments

This video explains a very important geometric algorithm which is asked in interviews frequently which is the klee's algorithm. This algorithm is used to find the longest line which is formed by the given line segments,i.e., finding the longest length of union of segment of lines. I have explained a very specific technique which works in just O(NlogN). As usual, the CODE LINK is given below. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)
CODE LINK: gist.github.com/SuryaPratapK/...

[@harilalmn]

Nicely explained.. Thanks...

[@satyaprakashsingh952]

No one can explain like you

[@lalityadav7377]

Nice Explanation...Anyway you are great bro...even free...thank you so much!

[@techdose4u]

Welcome :)

[@kishanjaiswal1975]

Thanks bro for this type of content/Algorithm's. As I have never came across this type of problems.Thanks mate!!! It will be helpful if you could upload such more Algorithm's as my placements are going to start in the coming months.

[@techdose4u]

My prime goal is to put videos which will help in interviews :)

[@kishanjaiswal1975]

Can you also give me some suggestion to improve my coding skills 🙏🙏

[@techdose4u]

Keep practicing and try solving new questions :) keep trying harder.

[@yashpreetbathla4653]

Thank you so much sirrr , keep making this kind of important Algorithm 😻❤️

[@techdose4u]

Sure :)

[@shan_singh]

Thank you klee That was clever

[@akhila5597]

Interesting ! thanks a lot

[@techdose4u]

Welcome :)

[@amitavamozumder73]

we can also just sort with starting value and use a stack right? push if we can join them or check stack top and bot difference and pop them all.

[@satyaprakashsingh952]

I watch your video everyday

[@Tracks777]

nice content

[@techdose4u]

:)

[@abhiarya7893]

Can I solve this question using Merge Interval Question which is more easy than this algorithms

[@jasmin_bheda]

thank u brother ♥

[@techdose4u]

Welcome :)

[@satyasahoo9573]

Had we taken the line, 8-12, instead of 9-12, the counter must have also hit zero at 6:20, but there will not be any gap. How can we be so sure that there will be a gap.

[@HimanshuSharma-tm2ms]

it won;t hit zero as (8,f) will come before (8,t) so counter will increase and will become zero at 12 only

[@pleasesirmorevideos4684]

is there any place where i can submit solution for this problem. i want to check m solution. anyone?

[@anupamkgupta2932]

I also want to submit this problem solution

[@mromega8945]

This is Victor Klee's algorithm?

[@mwshubham]

I didn't find this algo much exciting as one can simply sort the array using in place algo and run a loop to calculate it.

[@mwshubham]

Thanks for the wonderful explanation as always.