Search⌘ K
AI Features
Home
Courses
Learn Data Structures and Algorithms

Problem: Moving Average from Data Stream

Explore how to implement a MovingAverage class that calculates the moving average of integers from a data stream using a sliding window technique. Learn to use a queue (deque) to maintain window elements and update a running sum for constant time average calculation. Understand the time and space complexity of this approach.

We'll cover the following...

Statement

Given a stream of integers and a window size, calculate the moving average of all integers within the sliding window.

Implement the MovingAverage class:

  • MovingAverage(int size): Initializes the object with the window size size.

  • double next(int val): Accepts a new integer val from the stream and returns the moving average of the most recent size values seen so far.

Note: If fewer than size values have been received so far, the moving average is computed over all the values received up to that point.

Constraints:

  • 1≤1 \leq size ≤1000 ...