275. H-Index II - LeetCode Solution

class Solution:
    def hIndex(self, citations: List[int]) -> int:
        left = 0
        right =len(citations) -1 
        val = 0
        
        
        while right>=left:
            
            
            mid = (right+left)//2
            
            
            if citations[mid]>=len(citations)-mid:
                val = max(val,len(citations)-mid)
                right = mid-1
            else:
                left = mid+1
                
                
        return val