9.1 Knuth-Morris-Pratt KMP String Matching Algorithm
23:50
9.2 Rabin-Karp String Matching Algorithm
12:50
Knuth–Morris–Pratt(KMP) Pattern Matching(Substring search)
31:53
8. NP-Hard and NP-Complete Problems
24:42
7.3 Traveling Salesman Problem - Branch and Bound
39:41
10.2 B Trees and B+ Trees. How they are useful in Databases
27:54
5. Everything about JAVA Data Types
17:14
8.1 NP-Hard Graph Problem - Clique Decision Problem
26:04