Design top-K tracker with linked lists

Q: Design top-K tracker with linked lists

This question evaluates data structure design and algorithmic analysis skills, focusing on frequency tracking, tie-breaking and deletion semantics, and reasoning about time and memory complexity.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Design a data structure that tracks the top-K most frequent keys in a stream. Support operations increment(key), decrement(key), and topK(k) -> list of k keys with highest frequencies. Achieve O(

amortized updates by combining a hash map with a doubly linked list of frequency buckets. Specify tie-breaking, deletion behavior when counts drop to zero, memory usage, and complexity.

Design top-K tracker with linked lists

Overview

Comments (0)