Suffix array finding unique substrings

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

Github link:

Kattis link:

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

Remember... substrings are prefixes of suffixes of the string! Realizing this made the concepts clear!

CommonCoder
Автор

I read two books to try to understand the concept. Your video beats their explanations!

paklau
Автор

With the help of this, we can easily find the number of unique substrings, but what if we need to find the unique substrings themselves and not just the number? Do we have to resort back to the naive approach then?

elemento
Автор

Why does this work? I agree the relationship holds. What intuition leads to this idea though?

geogreenmanu
Автор

Excellent content, thanks for creating these videos!

whatdoyousay
Автор

Naive algorithm takes O(n^3) time instead of O(n^2)

Himanshu-edmf
Автор

It's really strange and confusing to talk about the 'unique substrings' in this context, as that would be the set: {azaz, azaza, zaz, zaza}, i.e. the set containing all those substrings that are not repeated and occur only once. What is meant here is the collection of all substrings without any duplicates, i.e. the substring set.

oxymoron
welcome to shbcf.ru