Add solution #692

Author: JoshCrozier

README.md

@@ -522,6 +522,7 @@
 688|[Knight Probability in Chessboard](./0688-knight-probability-in-chessboard.js)|Medium|
 689|[Maximum Sum of 3 Non-Overlapping Subarrays](./0689-maximum-sum-of-3-non-overlapping-subarrays.js)|Hard|
 690|[Employee Importance](./0690-employee-importance.js)|Medium|
+692|[Top K Frequent Words](./0692-top-k-frequent-words.js)|Medium|
 693|[Binary Number with Alternating Bits](./0693-binary-number-with-alternating-bits.js)|Easy|
 695|[Max Area of Island](./0695-max-area-of-island.js)|Medium|
 696|[Count Binary Substrings](./0696-count-binary-substrings.js)|Easy|

solutions/0692-top-k-frequent-words.js

@@ -0,0 +1,24 @@
+/**
+ * 692. Top K Frequent Words
+ * https://leetcode.com/problems/top-k-frequent-words/
+ * Difficulty: Medium
+ *
+ * Given an array of strings words and an integer k, return the k most frequent strings.
+ *
+ * Return the answer sorted by the frequency from highest to lowest. Sort the words with
+ * the same frequency by their lexicographical order.
+ */
+
+/**
+ * @param {string[]} words
+ * @param {number} k
+ * @return {string[]}
+ */
+var topKFrequent = function(words, k) {
+  const map = new Map();
+  words.forEach(word => map.set(word, (map.get(word) || 0) + 1));
+  return [...map.entries()]
+    .sort((a, b) => b[1] - a[1] || a[0].localeCompare(b[0]))
+    .slice(0, k)
+    .map(([word]) => word);
+};