Minimum Operations to Make Subarray Elements Equal

Given an integer array and a target subarray length k, find the minimum number of ±1 operations needed to make all elements of some contiguous subarray of length k equal. The core challenge is computing the sum of absolute deviations to the optimal target (the window median) efficiently for every sliding window, so you need a fast sliding-window median / prefix-sum approach.