Practice Google Coding Question | Real Coding Interviews

Quick Summary

Calculate the average of each fixed-size sliding window after removing its k largest elements.
Dynamically update the window contents and maintain an accurate running sum.
Correctly handle duplicate values when determining which elements to exclude.

What This Tests

Common Patterns

Sliding WindowHashingSortingHeap / Priority Queue

Hint 1

Hint 2

What Interviewers May Ask Next

Report seen similar question in interview

Accepted

1.4k/2.7k

Acceptance Rate49.8%

Python3

Test Cases

Input

nums =

windowSize =

k =

Output

Expected