Add solution #912

Author: JoshCrozier

0912-sort-an-array.js

@@ -0,0 +1,34 @@
+/**
+ * 912. Sort an Array
+ * https://leetcode.com/problems/sort-an-array/
+ * Difficulty: Medium
+ *
+ * Given an array of integers nums, sort the array in ascending order and return it.
+ *
+ * You must solve the problem without using any built-in functions in O(nlog(n)) time
+ * complexity and with the smallest space complexity possible.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var sortArray = function(nums) {
+  if (nums.length <= 1) {
+    return nums;
+  }
+
+  const min = Math.min(...nums);
+  const max = Math.max(...nums);
+  const count = new Array(max - min + 1).fill(0);
+
+  nums.forEach(n => count[n - min]++);
+
+  for (let i = 0, j = 0; i < count.length; i++) {
+    while (count[i]-- > 0) {
+      nums[j++] = i + min;
+    }
+  }
+
+  return nums;
+};

README.md

@@ -252,6 +252,7 @@
 890|[Find and Replace Pattern](./0890-find-and-replace-pattern.js)|Medium|
 901|[Online Stock Span](./0901-online-stock-span.js)|Medium|
 905|[Sort Array By Parity](./0905-sort-array-by-parity.js)|Easy|
+912|[Sort an Array](./0912-sort-an-array.js)|Medium|
 914|[X of a Kind in a Deck of Cards](./0914-x-of-a-kind-in-a-deck-of-cards.js)|Medium|
 916|[Word Subsets](./0916-word-subsets.js)|Medium|
 922|[Sort Array By Parity II](./0922-sort-array-by-parity-ii.js)|Easy|