Solution: Finding MK Average

Understand how to create a data structure that efficiently calculates the MK Average over a stream of integers. This lesson guides you through implementing and balancing three sorted lists to maintain a moving window, updating the middle sum dynamically, and handling insertions and deletions. You'll gain practical skills in using binary search, deques, and sorted lists to optimize your solution for coding interviews.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

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:

Stream length check: If the stream contains fewer than m elements, return -1 as the MK Average.
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.
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() ...