Longest common substring problem suffix array

preview_player
Показать описание
Related Videos:

Longest common substring implementation:

Kattis problem:

My website:
===============================================================================
Developer tools I used in the creation/testing of the content in these videos:

2) Kite, a free AI-powered coding assistant that provides smart code completions while typing:
=============================================================================== ===================================

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

How do you actually construct the suffix arrays where colors interlace together ?

FireEx-brmq
Автор

Great video man! Please keep doing these videos!

MauriPastorini
Автор

Thanks for your amazing video. A min-heap is also good to solve when sliding.

litianyi
Автор

Correction 8:08 ..more of these to be greater than *zero.

charaiveticharaiveti
Автор

Thanks for uploading the video. It's really clear and smart!

hanzhoutang
Автор

Why do we need to expand and shrink the window? Can we do it by sliding window of constant size (=K)?

gaurishgangwar
Автор

I love this video, which is very easy to follow. I have a question, though: how do you actually compare the 'colours' at 4:31? I guess it would be to find the 'nearest senitel' (in this case #, % and $, respectively), but I'm not sure.

ts-nymx
Автор

Isn't this the approach used by femtozip to build an effective "dictionary" string to prepend to the input, so that the actual strings in the text compress really well?

JobvanderZwan
Автор

In C the last sentinel value is already provided for you.

patryk_
Автор

The sentinels must be unique, .
What happens if you have a lot of strings.
Surely, eventually you are going to ran out of unique ones.
Maybe i am missing something?

ovndfbs
Автор

Sorry, but I lost you on colors. I don't understand how colors are determined.

uknow