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.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 275. H-Index II

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact