tag

#median

8 pages tagged

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 296: Best Meeting Point

Problem Restatement We are given a 2D grid containing only 0 and 1 . Each 1 marks the home of one person. A group of people wants to meet at one grid cell while minimizing the total travel distance. Distance is measured by Manhattan distance: distance = abs(r1 - r2) + abs(c1 - c2) We need to return the minimum possible total distance. The source statement says there are two...
leetcode math sorting matrix median May 10, 2026
Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 462: Minimum Moves to Equal Array Elements II

Problem Restatement We are given an integer array nums . In one move, we can either increment or decrement one element by 1 . We need to return the minimum number of moves required to make all array elements equal. The official statement defines the move as incrementing or decrementing one array element by 1 . For example: nums = [1, 2, 3] We can make all values equal to...
leetcode array math sorting median May 10, 2026
Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 4: Median of Two Sorted Arrays

Problem Restatement We are given two sorted arrays: nums1 nums2 Their sizes are m and n . We need to return the median of the two arrays as if both arrays were merged into one sorted array. The required time complexity is: O(log(m + n)) So we should not solve this by fully merging the arrays. The LeetCode statement requires a logarithmic-time solution. Input and Output Item Meaning Input Two...
leetcode array binary-search median May 10, 2026
Programming › Algorithm Cookbook › Chapter 6. Sorting ›

6.14 Median Selection

6.14 Median Selection Median selection finds the middle value of a collection without fully sorting it. A full sort gives the median, but it also computes much more order information than the median requires. Selection algorithms avoid that extra work. Problem You have an array A[0..n-1] . You want the median value, or one of the median values, using less work than sorting the whole array. Median Definitions For an...
algorithms sorting median selection May 4, 2026
Wiki › Algorithms › 01. Searching and Sorting › 5. Selection and Order Statistics ›

Upper Median

Upper Median Selection Upper Median Selection returns the upper median of a sequence. For even length arrays, it chooses the larger of the two middle elements. This complements the lower median and is useful when tie-breaking must favor larger values. Problem Given an array $A$ of length $n$, return the element with rank: $$ k = \left\lfloor \frac{n}{2} \right\rfloor $$ That is: for odd $n$, the unique median for even...
algorithms selection median order-statistics
Wiki › Algorithms › 01. Searching and Sorting › 5. Selection and Order Statistics ›

Lower Median

Lower Median Selection Lower Median Selection returns the lower median of a sequence. For even length arrays, there are two central elements. The lower median is the smaller of the two. This definition is common in discrete settings where a single representative element must be chosen. Problem Given an array $A$ of length $n$, return the element with rank: $$ k = \left\lfloor \frac{n - 1}{2} \right\rfloor $$ That is:...
algorithms selection median order-statistics
Wiki › Algorithms › 01. Searching and Sorting › 9. Partial, Online, and Adaptive Sorting ›

Rolling Median Sort

Rolling Median Sort Rolling median sort maintains the median value over a sliding window. Instead of fully sorting the window, it keeps just enough structure to extract the median efficiently. You use it when median or percentile queries are needed over recent data. Problem Given a stream ( x_1, x_2, \dots ) and window size ( w ), compute the median of: [ [x_{t-w+1}, \dots, x_t] ] after each step....
algorithms sorting median sliding-window heaps
Wiki › Algorithms › 01. Searching and Sorting › 5. Selection and Order Statistics ›

Median Maintenance

Median Maintenance by Two Heaps Median Maintenance keeps track of the median as values arrive one by one. It uses two heaps to maintain a balanced partition of the data. A max heap stores the lower half A min heap stores the upper half The median is derived from the roots of these heaps. Problem Given a stream $$ x_1, x_2, \dots, x_n $$ after each insertion, report the median...
algorithms streaming median heaps