Great explanation. Just flunked my OA with this one (solved with TLE). Appreciate the vid.

This video is crazy well produced and you are an amazing explainer. I really hope you do produce more videos, the competetive coding community would benefit greatly!

woah 5 minutes into the video and i already have a clear cut idea of what line sweep means. great job.

came from a lc discussion forum. this was a very very well produced vid and u explained the solution very well. please continue making more!

good one bro

Great explanation. Learned so much from it.

Nice! I had a similar problem where I had to count the number of total spots only illuminated by one light. Wasn't able to solve within the time limit but came up with this solution afterwards. Glad to know it was right :)

Really helpful, I always get stuck on the 4th question in a codesignal. Do you have any tips/suggestions that for this kind of situation? I want to get really better at this.

great explanation, Roblox ask those kind of question in their online assesment

Hello brother, thanks for the explanation. May I know where to access all the questions similar to this one. Thank in advance

What are the bounds on the coordinates? depending on what they are, we could translate every co-ordinate by some fixed k to be nonnegative, declare arr = [0] * (max_light_coordinate) mark start and end of a lit spot by 1, -1 for light in lights: arr[light[0]] = 1 arr[light[1]] = -1 have a map for the benches for fast lookup for i in range(1, len(arr)): arr[i] = arr[i-1] + arr[i] if i in bench_map: bench_map[i] = arr[i] then u just return the key, value pairs inside the bench_map as needed. O(n). Lemme know if this fails any edge case

I solved this one but in O(N^2)

I just got asked this question. I got time limit exceeded.