You are given an array of integers citations, where each element citations[i] represents the number of citations received for the $i^{th}$ publication of a researcher.

Your task is to find the researcher’s h-index and return the value of $h$.

Note: The h-index is defined as the highest number $h$ such that the given researcher has published at least $h$ papers, each of which has been cited at least $h$ times.

Constraints:

• $n ==$ citations.length

• $1 \leq n \leq 1000$

• $0 \leq$ citations[i] $\leq 1000$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding on how to solve this problem.

Implement your solution in the following coding playground.