Knuth-Morris-Pratt (KMP) Algorithm FULLY Explained [With Animation]
Автор: LYB Laid Off
Загружено: 2025-09-05
Просмотров: 592
Описание:
#algorithm #kmp #knuthmorrispratt #string
Knuth-Morris-Pratt (KMP) is an efficient string matching algorithm. It finds all occurrences of a pattern in a text by reusing previously matched information in O(n+m) time.
00:00 Intro & Brute-force
00:28 KMP - Key Observation
01:11 Longest Prefix-Suffix (LPS)
02:06 LPS Table with Example
02:58 KMP - Code Dry-Run
04:42 KMP - Complexity Analysis
05:36 Build LPS Table - Brute-Force
06:15 Build LPS Table - Key Observations
07:50 Build LPS Table - Code Dry-Run
09:31 Build LPS Table - Complexity Analysis
10:05 Simpler Implementation Using LPS Only
10:59 Quick Revisit
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке: