Add solution #347

Author: JoshCrozier

README.md

@@ -29,6 +29,7 @@
 264|[Ugly Number II](./0264-ugly-number-ii.js)|Medium|
 283|[Move Zeroes](./0283-move-zeroes.js)|Easy|
 345|[Reverse Vowels of a String](./0345-reverse-vowels-of-a-string.js)|Easy|
+347|[Top K Frequent Elements](./0347-top-k-frequent-elements.js)|Medium|
 349|[Intersection of Two Arrays](./0349-intersection-of-two-arrays.js)|Easy|
 350|[Intersection of Two Arrays II](./0350-intersection-of-two-arrays-ii.js)|Easy|
 387|[First Unique Character in a String](./0387-first-unique-character-in-a-string.js)|Easy|

solutions/0347-top-k-frequent-elements.js

@@ -0,0 +1,24 @@
+/**
+ * 347. Top K Frequent Elements
+ * https://leetcode.com/problems/top-k-frequent-elements/
+ * Difficulty: Medium
+ *
+ * Given an integer array `nums` and an integer `k`, return the `k` most
+ * frequent elements. You may return the answer in any order.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number[]}
+ */
+var topKFrequent = function(nums, k) {
+  const map = new Map();
+
+  nums.forEach(value => map.set(value, (map.get(value) || 0) + 1));
+
+  return [...map]
+    .sort((a, b) => b[1] - a[1])
+    .slice(0, k)
+    .map(([value]) => value)
+};