Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 275. H-Index II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source