Quick Overview

Compute one average per fixed-size sliding window after removing exactly the largest k values, counting duplicates separately. Support negative numbers, k equal to zero, and a stream-like pass over up to 200,000 inputs without re-sorting every window.

Sliding Window Average After Dropping the Largest Values

Company: Google

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Overview: Compute one average per fixed-size sliding window after removing exactly the largest k values, counting duplicates separately. Support negative numbers, k equal to zero, and a stream-like pass over up to 200,000 inputs without re-sorting every window.

Loading…