LeetCode 462: Minimum Moves to Equal Array Elements II
A clear explanation of why the median minimizes the number of moves needed to make all array elements equal.
Tag
Median
8 notes
LeetCode 296: Best Meeting Point
A median-based solution for minimizing total Manhattan distance in a grid.
LeetCode 4: Median of Two Sorted Arrays
A detailed explanation of finding the median of two sorted arrays using binary search over partitions.
Rolling Median Sort
Maintain the median of a sliding window using two heaps while the window moves over a stream.
Upper Median Selection
Select the upper median, the element at index floor(n/2), using selection or partitioning.
Lower Median Selection
Select the lower median, the element at index floor((n-1)/2), using selection or partitioning.
Median Maintenance by Two Heaps
Maintain the median of a stream using a max heap and a min heap.
6.14 Median Selection
Find the middle value of a collection in linear time using selection algorithms, without the overhead of a full sort.