CS_learn/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2026-04-01 01:51:00 +08:00
Code Issues Packages Projects Releases Wiki Activity

misc: restructure contents

Browse Source
This commit is contained in:
Yangshun Tay
2019-07-14 18:52:41 -07:00
parent 2e84bea6ba
commit c19c9626d1
83 changed files with 373 additions and 344 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
contents/algorithms/hash-table.md Normal file
View File

@@ -0,0 +1,11 @@
---
id: hash-table
title: Hash Table
---
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()`.
- [Source](http://blog.gainlo.co/index.php/2016/08/14/uber-interview-question-map-implementation/).