Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Basic - Algorithms & Data Structures: DP,Hashing,Trie,Suffix Tree
Orientation
Orientation (0:30)
String Search:Hashing,Karp–Rabin,KMP,Boyer-Moore,Trie,Suffix Tree & Array
Intro, Learning objectives (0:30)
Hashing,Hash Table,Hash Function,Collision (8:11)
Pattern Matching,Brute Force,Karp–Rabin,KMP(Knuth-Morris-Pratt),Boyer-Moore (21:47)
Trie, Suffix Trie (2:56)
Suffix Tree, Compressed Trie (4:49)
Suffix Array,complexity and advantages,LCP Array (3:18)
Compression:Run-Length Encoding,Huffman,Lampel-Ziv-Welch,Arithmetic Coding (8:28)
Summary (6:03)
Teach online with
Trie, Suffix Trie
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock