H-Index LeetCode solution in JavaScript

1
var hIndex = function (citations) {
2
  citations.sort((a, b) => b - a);
3
  let i = 0;
4
  while (citations[i] > i) i++;
5

6
  return i;
7
};