Implement an All $O(1)$ Data Structure

Question

Accepted Answer

Design a data structure that supports the following operations in $O(1)$ time: `inc(key)`, `dec(key)`, `getMaxKey()`, and `getMinKey()`. This requires linking multiple Doubly Linked Lists and Hash Maps.

Implement an All $O(1)$ Data Structure

Question Explain

Start Trying This Question Simulation

Other interview questions like this

Reverse a Linked List

Kth Smallest Element in a BST

Lowest Common Ancestor of a BST