![]() |
Weekly Problems #10 |
| Pedro Ribeiro - DCC/FCUP |
This is one of 11 weekly problem sets. Each one is worth 10% of the grade of the "Submitted Implementation" evaluation criteria.
6 proposed problems:
- Can you use KMP?
- DFS with backtracking; you can use a trie to look for "all words" at the same time :)
- Can you think on how to use suffix arrays?
- Can you think on how to adapt the KMP failure function (π)?
- Can you combine KMP with Dynamic Programming? ;)
- Can you combine Aho-Corasick with Dynamic Programming? ;)
About the delivery:
Pedro Ribeiro - DCC/FCUP | Last update: