Finding H-index

Problem

Find h-index given array of numbers.

For more information about h-index, check out the following link.

https://en.wikipedia.org/wiki/H-index

The idea is that you need to find the last value in the array where the value is larger than its index.

For example,

 Say Scientist A has 5 publications with the following citation count.

  Publications = {10, 8, 5, 4, 3}.

In this case, the h-index is 4 since 4 whose index is 3 is the last value which value is larger than its index.


Answer

Given the fact that you are searching the sorted values, we can use a binary search to find the h-index.
This algorithm will run in O( log N).

My first attempt was a little lousy and ran in O(N). It used the brute force search.

This is the code using binary search. We assume that the input is already sorted in descending order.

If not, the running time will be O( N log N) due to the sorting. We can use either quick sort or merge sort for this.




UPDATE (2019-07-31): solved the problem again in python using the binary search. Made silly mistakes that was found after running the code.


Practice statistics:

12:19: to write the correct algorithm for h-index
10:26: to write the code and test code (two bugs found after running. not returning the search result.)


UPDATE(2022-06-12): Solved the problem again. Took a while to understand what H-index is. Had a critical bug in the binary search to find the h-index.

Comments

Post a Comment

Popular posts from this blog

  Given an array of  intervals  where  intervals[i] = [start i , end i ] , merge all overlapping intervals, and return  an array of the non-overlapping intervals that cover all the intervals in the input . Example 1: Input: intervals = [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]] Explanation: Since intervals [1,3] and [2,6] overlap, merge them into [1,6]. Example 2: Input: intervals = [[1,4],[4,5]] Output: [[1,5]] Explanation: Intervals [1,4] and [4,5] are considered overlapping.   Constraints: 1 <= intervals.length <= 10 4 intervals[i].length == 2 0 <= start i <= end i <= 10 4
Read more

Planting flowers with no adjacent flower plots

Image
Problem Suppose you have a long flowerbed in which some of the plots are planted and some are not. However, flowers cannot be planted in adjacent plots - they would compete for water and both would die. Given a flowerbed (represented as an array containing booleans), return if a given number of new flowers can be planted in it without violating the no-adjacent-flowers rule  Sample inputs  Input: 1,0,0,0,0,0,1,0,0  3 => true  4 => false  Input: 1,0,0,1,0,0,1,0,0  1 => true  2 => false  input: 0  1 => true  2 => false  public boolean canPlaceFlowers(List flowerbed, int numberToPlace) {  // Implementation here  }
Read more

Stock price processing problem

Question You are given a stream of records about a particular stock. Each record contains a timestamp and  the corresponding price of the stock at that timestamp. Unfortunately due to the volatile nature of the stock market, the records do not come in order. Even worse, some records may be incorrect.  Another record with the same timestamp may appear later in the stream   correcting the price of the previous wrong record. Design an algorithm that: Updates the price of the stock at a particular timestamp, correcting the price from any previous records at the timestamp. Finds the latest price of the stock based on the current records. The latest price is the price at the latest timestamp recorded. Finds the maximum price the stock has been based on the current records. Finds the minimum price the stock has been based on the current records. Implement the StockPrice class: StockPrice() Initializes the object with no price records. void update(int timestamp, int price) Updates the price of
Read more