Maintain k-th largest in a stream

Q: Maintain k-th largest in a stream

This question evaluates understanding of data structures and streaming algorithms for maintaining k-th order statistics under dynamic inserts, emphasizing time-space trade-offs and correct handling of duplicates.

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 and implement a class KthLargest that, given an integer k and an initial list of integers, supports: (

KthLargest(k, nums): constructor; (
add(val): adds val to the data structure and returns the current k-th largest element. Achieve O(log k) time per insertion and O(k) space. Describe your data structures, handle duplicates, and analyze complexity.

Maintain k-th largest in a stream

Overview

Comments (0)