Search
⌘K
Leetcode 275. H-Index II
Given a non-decreasing array of citation counts, compute the h-index — the largest h such that at least h papers have ≥ h citations. Exploit the sorted order to find this value in O(log n) time (binary search).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.