chore(Blind): add answer key and solutions for deduction problems

work/Medium/Array/347.top-k-frequent-elements.js

@@ -0,0 +1,62 @@
+/*
+ * 347. Top K Frequent Elements
+ * Difficulty: Medium
+ * https://leetcode.com/problems/top-k-frequent-elements/
+ *
+ * ──────────────────────────────────────────────────
+ *
+ * Given an integer array nums and an integer k, return the k most
+ * frequent elements. You may return the answer in any order.
+ *
+ *
+ *
+ * Example 1:
+ *
+ * Input: nums = [1,1,1,2,2,3], k = 2
+ *
+ * Output: [1,2]
+ *
+ * Example 2:
+ *
+ * Input: nums = [1], k = 1
+ *
+ * Output: [1]
+ *
+ * Example 3:
+ *
+ * Input: nums = [1,2,1,2,1,2,3,1,3,2], k = 2
+ *
+ * Output: [1,2]
+ *
+ *
+ *
+ * Constraints:
+ *
+ * 	• 1 <= nums.length <= 10^5
+ *
+ * 	• -10^4 <= nums[i] <= 10^4
+ *
+ * 	• k is in the range [1, the number of unique elements in the array].
+ *
+ * 	• It is guaranteed that the answer is unique.
+ *
+ *
+ *
+ * Follow up: Your algorithm's time complexity must be better than O(n
+ * log n), where n is the array's size.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number[]}
+ */
+var topKFrequent = function (nums, k) {
+  const freq = {};
+  for (let n of nums) freq[n] = (freq[n] || 0) + 1;
+
+  return Object.keys(freq)
+    .map(Number)
+    .sort((a, b) => freq[b] - freq[a])
+    .slice(0, k);
+};

work/Medium/Hash Table/451.sort-characters-by-frequency.js

@@ -0,0 +1,64 @@
+/*
+ * 451. Sort Characters By Frequency
+ * Difficulty: Medium
+ * https://leetcode.com/problems/sort-characters-by-frequency/
+ *
+ * ──────────────────────────────────────────────────
+ *
+ * Given a string s, sort it in decreasing order based on the frequency
+ * of the characters. The frequency of a character is the number of times
+ * it appears in the string.
+ *
+ * Return the sorted string. If there are multiple answers, return any
+ * of them.
+ *
+ *
+ *
+ * Example 1:
+ *
+ * Input: s = "tree"
+ * Output: "eert"
+ * Explanation: 'e' appears twice while 'r' and 't' both appear once.
+ * So 'e' must appear before both 'r' and 't'. Therefore "eetr" is also
+ * a valid answer.
+ *
+ * Example 2:
+ *
+ * Input: s = "cccaaa"
+ * Output: "aaaccc"
+ * Explanation: Both 'c' and 'a' appear three times, so both "cccaaa"
+ * and "aaaccc" are valid answers.
+ * Note that "cacaca" is incorrect, as the same characters must be
+ * together.
+ *
+ * Example 3:
+ *
+ * Input: s = "Aabb"
+ * Output: "bbAa"
+ * Explanation: "bbaA" is also a valid answer, but "Aabb" is incorrect.
+ * Note that 'A' and 'a' are treated as two different characters.
+ *
+ *
+ *
+ * Constraints:
+ *
+ * 	• 1 <= s.length <= 5 * 10^5
+ *
+ * 	• s consists of uppercase and lowercase English letters and digits.
+ */
+
+/**
+ * @param {string} s
+ * @return {string}
+ */
+var frequencySort = function (s) {
+  // count the frequency of each character
+  const freq = {};
+  for (let c of s) freq[c] = (freq[c] || 0) + 1;
+
+  // sort the characters by frequency
+  return s
+    .split("")
+    .sort((a, b) => freq[b] - freq[a] || a.localeCompare(b))
+    .join("");
+};