LeetCode Question · Nov 2021

Microsoft | Onsite | Design a HashMap

1 upvote 534 views 5 replies

Question Details

Constraint: 1. No library I was able to implement O(n) GET and O(n) PUT in the first iteration. Is there any way this can we can get O(logn) time complexity for both...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Hash Table System Design