William tu to devta nikla re! Awesome 🔥

WOAH this is really awesome, I appreciate the hard work put behind creating such top-notch quality content. your explanation is amazing William, please do keep posting such video's.

This is pure gold William, thank you for such a great content. I've been struggling with an advanced problem in Hackerrank and your video series about trees just pointed me to the right direction. :D

Amazing explanation! I'm finally at peace with this concept 👌

In first 2-3 minute u realize ur at right place for ur concept... awesome video:)

Shoutout to William and folks who contributed to this fantastic video. That being said, it's really a bummer that we're missing a video about a segment tree. Fenwick tree and Sparse table have its own advantages to select as primary datastructures, but when you need a point update for RMQ, then we definitely need to turn our heads to a segment tree :( The fact that other online sources aren't as easy to consume knowledge as your video, it would be much appreciated if you could make one in future!

Thank you william from South Korea!! Please do not remove these awsome videos. It really helped me a lot and helping me now. You make complicated things easy. I thank you again.!!

Amazing explanantion, was really helpful, thank you to William and the other collaborators!

Great explanation William . Can you post some videos on string matching algorithms also.

Great video! Very clear and concise!

amazing presentation. I prefer first to watch some videos like these to grip the high-level idea and read the book to dive deeper.

at 13:03 the equation of len should be len = r - l + 1 since r > l.

Fantastic video, concept well explained🎉🎉

very clear and concise!

Thanks for the video. Finally, there's a good tutorial on Sparse tables. In your opinion, would you choose Sparse table over Segment trees

Thank you for the great explaination

Thank you for the explanation

Amazing video

ThankYou so much for this !!

why will i want to use a sparse table for functions without good overlap?? i can use segment tree...

19:35 What happens with i is odd, and i/2 is a non-integer index of array log2

at 12:58, it should be len = R - L + 1 = 11 - 1 + 1, or?

wonderful

You should really bring the volume for your voice up, either via directly speaking to microphone louder or post processing as I have you turned up to 100% and if the room isn't completely quiet I cant hear you. If i play a song off of youtube at 5% it drowns you out even when your at 100% . Other than that great videos!

Thank you William. How did you compute last row at 16:00 please? I see that first element should be 2*-6*-6= -12*-6 = 72, but you wrote -12, why?

It's very helpful

So, the time complexity is O(log(n)), and space complexity is O(n*log(n)) ?

ty!

Just Wow!

why i+(1

awesome

In CascadingMinQuery(), for product example where we have to find product of all elements between [0,6]. In first iteration of for loop we will have [0, 0 + 2^2) in next iteration it will be [4, 4 + 2^2) which should be [4, 4 + 2^1) as discussed in product range query example. We will not be having the t[2][4] in sparse table. Then how to check that in the function

this is the best

Thanks for the tutorial. Can you please make video on lca queries as well?

Didnt understand how the table was constructed at 9:27

great

Why not using idempotency instead of overlap friendly term

Thanks for the great video. At 15:25 the last segment goes to 16. I think it's an error.

What if the array is not static? Can we use sparse table?

Volume is very low!

Dude the volume is so low