feat(exam): Update exam tasks with new content

The following changes have been made to the exam tasks:
- Replaced the "Effective Suffix Tree Construction" task with a more
  focused task on "Suffix Trie and Suffix Tree Space Complexity".
- Added a new task: "Finding a Repeating Substring in a Suffix Tree".
- Replaced "Effective Suffix Array Construction" with a task on
  "Efficient Suffix Array Construction" using the DC3 algorithm.
- Updated the "Pattern Matching with a Suffix Array" task to include
  pseudocode and focus on the binary search approach.
- Added a new task: "Encoding a Word with a Suffix Array (BWT)".
- Replaced "Aho-Corasick Algorithm" with a task defining and explaining
  the "Fail Function".
- Replaced "Edit Distance (Wagner-Fischer)" with a task explaining the
  algorithm and recurrence relation.
- Added a new task on "LCF vs. LCS" to clarify their differences and
  complexities.
- Added a new task on "Finding Palindromes" using suffix trees.
- Added a new task on "String Normal Form".
- Added a task to discuss the "Space Complexity of String Data
  Structures".
- Added a task on "Bit Parallelism (Shift-Or)".
- Added a task on "Wildcard Matching".
- Added a task on "DAWG and CDAWG Construction and Complexity".
- Added a new task: "Ukkonen-Myers Algorithm".

Author: Lastaapps