Leetcode 3679. Minimum Discards to Balance Inventory

Given a sequence of daily arrivals, a window size w, and a per-type cap m, compute the minimum number of arrivals that must be discarded (only on their arrival day) so that in every length-w window each item type appears at most m times. This is a sliding-window + frequency-counting problem: maintain per-type counts over the last w days and greedily discard any arrival that would push its type's count above m.