Must-do problems: Hash Tables from Scratch

These are the hash table problems every placement candidate should be able to solve: slots and chains, linear probing, sets and counts, and cache designs. Pick the structure first, a set, a dictionary of counts or a dictionary with a second structure. Trace a small input by hand, then check your program against every test.

1. 1.Slot for each keyEasy
2. 2.Longest chainEasy
3. 3.Distinct customersEasy
4. 4.First repeated orderEasy
5. 5.Two orders that match a totalEasy
6. 6.Linear probing tableMedium
7. 7.Probes for each lookupMedium
8. 8.Subarrays with a given sumMedium
9. 9.Anagram groupsMedium
10. 10.Longest consecutive runMedium
11. 11.LRU cache simulationMedium
12. 12.Growing tableHard
13. 13.Longest unique stretchHard
14. 14.Random set operationsHard
15. 15.Four lists that sum to zeroHard