Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Solution: Finding MK Average

Explore the implementation of an MKAverage class that maintains a moving window over a data stream, efficiently computing the MK Average by discarding smallest and largest elements. Understand how to use three sorted lists and a deque for insertion, removal, and rebalancing to enable fast average calculation. This lesson helps you apply custom data structures and binary search for scalable coding interview solutions.

We'll cover the following...

Statement

You are given two integers, m and k, and a stream of integers. Your task is to design and implement a data structure that efficiently calculates the MK Average for the stream.

To compute the MK Average, follow these steps:

  1. Stream length check: If the stream contains fewer than m elements, return -1 as the MK Average.

  2. Window selection: Otherwise, copy the last m elements of the stream to a separate container and remove the smallest k elements and the largest k elements from the container.

  3. Average calculation: Calculate the average of the remaining elements (rounded down to the nearest integer).

Implement the MKAverage class

  • MKAverage(int m, int k): Initializes the object with integers m and k and an empty stream.

  • void addElement(int num): Adds the integer num to the stream.

  • int calculateMKAverage() ...