René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/sort-an-array","name":"#912 - Sort an Array - LeetCode JavaScript Solutions","description":"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 func...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {number[]}\n */\nvar sortArray = function(nums) {\n  if (nums.length <= 1) {\n    return nums;\n  }\n\n  const min = Math.min(...nums);\n  const max = Math.max(...nums);\n  const count = new Array(max - min + 1).fill(0);\n\n  nums.forEach(n => count[n - min]++);\n\n  for (let i = 0, j = 0; i < count.length; i++) {\n    while (count[i]-- > 0) {\n      nums[j++] = i + min;\n    }\n  }\n\n  return nums;\n};","keywords":"LeetCode 912, #912 - Sort an Array, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}