Skip to content

Latest commit

 

History

History
7 lines (6 loc) · 524 Bytes

hash-table.md

File metadata and controls

7 lines (6 loc) · 524 Bytes
Raw

Hash Table

  • Describe an implementation of a least-used cache, and big-O notation of it.
  • A question involving an API's integration with hash map where the buckets of hash map are made up of linked lists.
  • Implement data structure Map storing pairs of integers (key, value) and define following member functions in O(1) runtime: void insert(key, value), void delete(key), int get(key), int getRandomKey().