Different algorithmic problems
- mergin tables (path compression)
- job queue (priority queues)
- build heap (generate heap datastructure)
- check brackets in code (stack)
- phone book (direct addresing with two maps)
- hash chains (hash table using the chaining scheme)
- find pattern in text (Rabin-Karp's algorithm with precomputed hashes)