tech-interview-handbook/contents/algorithms/hash-table.md

---
id: hash-table
title: Hash Table
---

## Sample questions

- 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()`. [(Solution)](http://blog.gainlo.co/index.php/2016/08/14/uber-interview-question-map-implementation/)
website: add front matter 5 years ago			`---`
			`id: hash-table`
			`title: Hash Table`
			`---`

chore: remove freeform questions 5 years ago			`## Sample questions`
Squash commit 7 years ago
			`- 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.`
website: launch website 5 years ago			- 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()`. [(Solution)](http://blog.gainlo.co/index.php/2016/08/14/uber-interview-question-map-implementation/)