dsa11 min read
H-Index II — Binary Search on Sorted Citations [LC 275]
Find the h-index from a sorted citations array in O(log n) time using left-boundary binary search. Full FAANG interview breakdown with visual dry run, all edge cases, and intuition behind the search condition.
Read →