Add solution #274

Author: JoshCrozier

README.md

@@ -161,6 +161,7 @@
 264|[Ugly Number II](./0264-ugly-number-ii.js)|Medium|
 268|[Missing Number](./0268-missing-number.js)|Easy|
 273|[Integer to English Words](./0273-integer-to-english-words.js)|Hard|
+274|[H-Index](./0274-h-index.js)|Medium|
 278|[First Bad Version](./0278-first-bad-version.js)|Medium|
 283|[Move Zeroes](./0283-move-zeroes.js)|Easy|
 290|[Word Pattern](./0290-word-pattern.js)|Easy|

solutions/0274-h-index.js

@@ -0,0 +1,26 @@
+/**
+ * 274. H-Index
+ * https://leetcode.com/problems/h-index/
+ * Difficulty: Medium
+ *
+ * Given an array of integers citations where citations[i] is the number of citations
+ * a researcher received for their ith paper, return the researcher's h-index.
+ *
+ * According to the definition of h-index on Wikipedia: The h-index is defined as the
+ * maximum value of h such that the given researcher has published at least h papers
+ * that have each been cited at least h times.
+ */
+
+/**
+ * @param {number[]} citations
+ * @return {number}
+ */
+var hIndex = function(citations) {
+  citations.sort((a, b) => a - b);
+  for (let i = 0; i < citations.length; i++) {
+    if (citations[i] >= citations.length - i) {
+      return citations.length - i;
+    }
+  }
+  return 0;
+};