LeetCode 791: Custom Sort String
A clear explanation of rearranging a string so that selected characters follow a custom order.
Tag
Counting-Sort
9 notes
LeetCode 274: H-Index
A clear explanation of the H-Index problem using sorting, then an optimized counting approach.
Parallel Counting Sort
Count key frequencies in parallel, compute prefix sums, then scatter elements into sorted positions.
Sparse Key Counting Sort
Counting sort variant that stores counts only for keys that appear, avoiding dense arrays over large key ranges.
Counting Sort with Negative Keys
Extend counting sort to handle negative integers by shifting keys into a nonnegative index range.
Counting Sort
Sort integers by counting occurrences of each key and reconstructing the output in linear time.
Key Indexed Counting
Counting-based stable sorting technique that maps keys to index ranges using frequency and prefix sums.
Stable Counting Sort
Stable variant of counting sort using prefix sums to preserve relative order of equal keys.
6.7 Counting Sort
Sort integer keys from a small range in linear time by counting occurrences and reconstructing the output from those counts.