Part 4 | Maps: hash tables and other implementations, Strings: Trie and sub-string search algo

• Objectives
• To read
• Exercises A
  • Symbol Table Implementations Comparison
  • Two-Sum Using a Hash Table
  • Modular Arithmetic and String Hashing in Java
  • Sign Bit Masking in Hash Functions
  • Java Map Hierarchy and Hashtable
  • Hash Collisions and Resolution Strategies
  • Load Factor and Resizing Strategies
  • Fail-Fast Iterator for LinearProbingHashST
  • Lazy Deletion with Tombstones in Linear Probing
  • Incremental Rolling Hash — Rabin-Karp
  • Single and Multi-Pattern Substring Search — Rabin-Karp
  • MCQ on Hash Functions
  • MCQ on Rabin-Karp
  • Word Counter
  • Incremental Hash
  • LRU Cache
  • Multi-Pattern Rabin-Karp
• Exercises B
  • Hash of Long and Double
  • Hash and Casting of Integers
  • String Hashing: Choice of M and R Constants
  • Design of a Hash Function for Vehicles
  • Design of a Hash Function: Citizens
  • Rabin-Karp Revisited
  • Linear Probing
  • Tries and Autocompletion
  • Monkeys and Hash Tables
  • Bitset