Відео

Nice solution thanks man. Question: Where is that debugger? is that in an IDE or leet code?

Nice solution. Keep it up bro. !

Bro… Explain the intuition of WHY this works. Literally anyone doing leetcode can read what you wrote line by line but if people don’t understand WHY we set p -> q in the case there’s no parent, and WHY them meeting means we’ve found a LCA, then your little video just either shows us you have an awful ability to communicate or no actual understanding of why this works. Submitting with no explanation and going “ezpz” is nuts lmao. If someone wrote this up and didn’t explain why it works they’d get insta-rejected. Awful.

{-8,-4,-2,-1,2,4,8} your logic is failed at this test case

Thanks Scott, this was really helpful. Cheers!

Hey scott if possible add a dsa sheet for beginner,loving your lecture i am learning a lot from u❤❤❤ love from India

in second loop you write == instead of ++

Thanks for the video, I have a question. in the question it states that we need to return a promise, how is this returning a promise?

Works perfectly and so easy to follow, especially when you take us through the debugger. Thank you! <3

now some will only get frosting 😂🤌

ScottHacksCode, Your videos always make me happy, so I subscribed!

You can sort the intervals array directly based on the start time and then do the comparison. That way, the space complexity will be O(1)

Promo sm

Found in recommendation. Subbed.

So there are still about 6% of Java implementations faster, makes me really curious what those implementations are. But overall nice solution to the challenge.

Love the work ❤ Can the playlist arranged in question sequence to easily surf ☺️