Fetching data...
This may take a moment
Back
3698. Minimum Operations to Make Subarray Elements Equal
Medium
Array
Hash Table
Math
Sliding Window
Heap (Priority Queue)
Solve on LeetCode
View Solutions
Description
Hints
Hint 1
It can be proven that for each subarray of size <code>k</code>, one optimal common value is the median.
Hint 2
Use 2 multisets to maintain the median dynamically.
Hint 3
Calculate the sums of the 2 multisets dynamically to accelerate the answer calculation.
Similar Questions
Find Median from Data Stream
Hard
Minimum Moves to Equal Array Elements II
Medium
Statistics
Acceptance
46.8%
Submissions
1,408
Accepted
659