String Algorithms

Day 1 (3 hours)

1. String Matching: Knuth-Morris-Pratt (1.5 hours)

2. Rabin-Karp (1.5 hours)

Day 2 (3 hours)

1. Trie Data Structure (1.5 hours)

2. Suffix Arrays (1.5 hours)

Day 3 (3 hours)

1. Suffix Trees (1.5 hours)

2. Z-Algorithm (1.5 hours)

Day 4 (3 hours)

1. Manacher’s Algorithm (1.5 hours)

2. Practice Problems (1.5 hours)

Day 5 (3 hours)

1. Summary and Review (3 hours)