Implement an All $O(1)$ Data Structure with Frequency

Question

Accepted Answer

Design a data structure that supports `inc(key)`, `dec(key)`, `getMaxKey()`, and `getMinKey()` in $O(1)$ time. This requires combining multiple Doubly Linked Lists, where each list holds keys of the same frequency, and a Hash Map.

Implement an All $O(1)$ Data Structure with Frequency

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