New
ML System Design & SQL tracks just landed
See what's new
×
Question Bank
Pricing
Blog
Forum
HOT
Referral
Description
Solution
Discussion
Submissions
Ask AI
Question Bank
Google
Coding Question
AI Insights
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
Sliding window mechanics for contiguous subarrays
Dynamic tracking of order statistics during state transitions
Efficient handling of duplicates in frequency-based data structures
Balancing time complexity against frequent recalculations
Common Patterns
Sliding Window
Hashing
Sorting
Heap / Priority Queue
Collapse
Hint 1
Hint 2
What Interviewers May Ask Next
Accepted
1.6k
/3.5k
Acceptance Rate
45.2%
Ask AI Assistant
Ask AI Assistant
Ask me anything about this coding question!
Qwen
Qwen3.6-Flash
0/2000
Auto
Debug
Run
Submit
Test Cases
Input
nums =
windowSize =
k =
Output
Expected
