Add solution #1636

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,437 LeetCode solutions in JavaScript
+# 1,438 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1260,6 +1260,7 @@
 1630|[Arithmetic Subarrays](./solutions/1630-arithmetic-subarrays.js)|Medium|
 1631|[Path With Minimum Effort](./solutions/1631-path-with-minimum-effort.js)|Medium|
 1632|[Rank Transform of a Matrix](./solutions/1632-rank-transform-of-a-matrix.js)|Hard|
+1636|[Sort Array by Increasing Frequency](./solutions/1636-sort-array-by-increasing-frequency.js)|Easy|
 1657|[Determine if Two Strings Are Close](./solutions/1657-determine-if-two-strings-are-close.js)|Medium|
 1668|[Maximum Repeating Substring](./solutions/1668-maximum-repeating-substring.js)|Easy|
 1669|[Merge In Between Linked Lists](./solutions/1669-merge-in-between-linked-lists.js)|Medium|

solutions/1636-sort-array-by-increasing-frequency.js

@@ -0,0 +1,25 @@
+/**
+ * 1636. Sort Array by Increasing Frequency
+ * https://leetcode.com/problems/sort-array-by-increasing-frequency/
+ * Difficulty: Easy
+ *
+ * Given an array of integers nums, sort the array in increasing order based on the frequency
+ * of the values. If multiple values have the same frequency, sort them in decreasing order.
+ *
+ * Return the sorted array.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var frequencySort = function(nums) {
+  const map = new Map();
+  nums.forEach(num => map.set(num, (map.get(num) || 0) + 1));
+
+  return nums.sort((a, b) => {
+    const freqA = map.get(a);
+    const freqB = map.get(b);
+    return freqA === freqB ? b - a : freqA - freqB;
+  });
+};