Topic:

• String Processing

Subtopic:

• String Hashing
• Rabin-Karp for String Matching
• Prefix function - Knuth-Morris-Pratt, etc.

Small Description:

Hashing is done by implementing a hash function which converts string to integer and then to compare two strings we actually compare their hashes and only if their hashes are equal we proceed to compare the strings.

Checks:

• explanation
• implementation
• references
• extra problems for practice