Data Structures
Kth Smallest Element in a Sorted Matrix
Kth Smallest Element in a Sorted Matrix (LeetCode 378): binary search on value, counting elements <= mid in O(n log(range)).
#Binary Search on Value
1 note tagged