PLAAANS

1. Strings

• Z algorithm
• Manacher Algorithm
• Rabin Karp
• Suffix arrays
• Boyer Moore
• Hashing/Rolling hash + bloom filters

2.1 Bits/Bitsets, additional harder problems

2.2 Hash - some more complex problems with rolling hash, or something else

2.3 Backtrack - first some common, important for understanding + lecture that goes with it

2.4 Divide and conquer - same as for backtrack

3. Trees

• Traversals
• Tricks with subtrees, diameters, paths + some little dp or combinatorics
• Some different types of trees:
  • AVL
  • BST
  • Trie
  • Treap
  • Heap
  • BIT(Fenwick)
  • Segment

4. Graphs - to be continued