1. Implement a hashtable\n1. Implement a data structure with 3 operations in O(1):\n    - Insert(int val)\n    - Remove(int val)\n    - RemoveRandom()\n1. https://leetcode.com/problems/building-h2o/ using condition variables\n1. Design a key value store where the keys are all 8 bytes long and fit in memory. Values do not fit in memory and should be read from disk.\n

Implement a hashtable\n1. Implement a data structure with 3 operations in O(1):\n    - Insert(int val)\n    - Remove(int val)\n    - RemoveRandom()\n1. https://