Sparse Table Data Structure

preview_player
Показать описание
Source code repository:

Video slides:

Website:

Рекомендации по теме
Комментарии
Автор

William tu to devta nikla re! Awesome 🔥

thunderbolt
Автор

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

ankitsinha
Автор

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!

alex
Автор

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.!!

daumtto
Автор

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

joydeepbhattacharjee
Автор

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

dotproduct
Автор

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.

jaatharsh
Автор

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

isaiasramirez
Автор

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

arsilvyfish
Автор

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

youngjim
Автор

Fantastic video, concept well explained🎉🎉

flyingtiger
Автор

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

uchennanwanyanwu
Автор

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

lucien
Автор

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!

arthurtapper
Автор

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

shameekagarwal
Автор

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

ShubhamJoshishubhamjoshi
Автор

why i+(1<<p) <=N it should be <N ?

shikharsaxena
Автор

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

lzhang
Автор

Didnt understand how the table was constructed at 9:27

bismeetsingh
Автор

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?

mohammadyahya
visit shbcf.ru