H-Index II Python Solution with Tests

lcpy gen -n 275   # by problem number
lcpy gen -s h_index_ii   # by problem name

Input: citations = [0,1,3,5,6]
Output: 3

Input: citations = [1,2,100]
Output: 2

class Solution:
    # Time: O(log n)
    # Space: O(1)
    def h_index(self, citations: list[int]) -> int:
        n = len(citations)
        lo, hi = 0, n - 1
        while lo <= hi:
            mid = (lo + hi) // 2
            if citations[mid] >= n - mid:
                hi = mid - 1
            else:
                lo = mid + 1
        return n - lo