Category
binary-search
H-Index (2)
The task involves finding the researcher's h-index from a sorted array of citations. The h-index represents the maximum value 'h' where the researcher has published at least 'h' papers, each cited at least 'h' times. 
Closest Subsequence Sum
Given a list of integers and a target number, the problem is to find the closest subsequence of that list that add up to the target number, return the sum of that subsequence