Trimmed Sliding Window Average

Given an integer array nums of length n, a window size w, and a non-negative integer k, slide a window of length w from left to right.

For every complete window:

  1. Remove the **largest `k...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: