      "### Remove\n",
      "\n",
      "* Get hash index for lookup\n",
      "* If key exists, delete the item\n",
      "\n",
      "Complexity:\n",
      "* Time: O(1) average and best, O(n) worst\n",
      "* Space: O(1)"
     ]
    },
 
</s> remove     "* Else, return None\n",
 </s> add     "* Else, raise KeyError\n", </s> remove     "* For collision resolution, can we use linked lists?\n",
 </s> add     "* For collision resolution, can we use chaining?\n", </s> remove     "* get on an empty hash table index\n",
    "* set on an empty hash table index\n",
    "* set on a non empty hash table index\n",
    "* set on a key that already exists\n",
    "* remove on a key with an entry\n",
    "* remove on a key without an entry"
 </s> add     "* `get` no matching key -> KeyError exception\n",
    "* `get` matching key -> value\n",
    "* `set` no matchin gkey -> new key, value\n",
    "* `set` matching key -> update value\n",
    "* `remove` no matching key -> KeyError exception\n",
    "* `remove` matching key -> remove key, value" </s> remove     "* get on an empty hash table index\n",
    "* set on an empty hash table index\n",
    "* set on a non empty hash table index\n",
    "* set on a key that already exists\n",
    "* remove on a key with an entry\n",
    "* remove on a key without an entry"
 </s> add     "* `get` no matching key -> KeyError exception\n",
    "* `get` matching key -> value\n",
    "* `set` no matchin gkey -> new key, value\n",
    "* `set` matching key -> update value\n",
    "* `remove` no matching key -> KeyError exception\n",
    "* `remove` matching key -> remove key, value" </s> remove     "    * No"
 </s> add     "    * No\n",
    "* Do we have to validate inputs?\n",
    "    * No\n",
    "* Can we assume this fits memory?\n",
    "    * Yes"
    "* Else, raise KeyError\n",
      "### Remove\n",
      "\n",
      "* Get hash index for lookup\n",
      "* If key exists, delete the item\n",
    "* Else, raise KeyError\n",
      "\n",
      "Complexity:\n",
      "* Time: O(1) average and best, O(n) worst\n",
      "* Space: O(1)"
     ]
    },
keep keep keep add keep keep keep keep keep keep
 Update hash map (#104)

Update constraints, test cases, algorithm, code, and tests. 
arrays_strings/hash_map/hash_map_solution.ipynb