René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/increasing-decreasing-string","name":"#1370 - Increasing Decreasing String - LeetCode JavaScript Solutions","description":"You are given a string s. Reorder the string using the following algorithm:  Remove the smallest character from s and append it to the resul...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {string} s\n * @return {string}\n */\nvar sortString = function(s) {\n  const charCounts = new Array(26).fill(0);\n  for (const char of s) {\n    charCounts[char.charCodeAt(0) - 97]++;\n  }\n\n  let result = '';\n  while (result.length < s.length) {\n    for (let i = 0; i < 26; i++) {\n      if (charCounts[i] > 0) {\n        result += String.fromCharCode(i + 97);\n        charCounts[i]--;\n      }\n    }\n    for (let i = 25; i >= 0; i--) {\n      if (charCounts[i] > 0) {\n        result += String.fromCharCode(i + 97);\n        charCounts[i]--;\n      }\n    }\n  }\n\n  return result;\n};","keywords":"LeetCode 1370, #1370 - Increasing Decreasing String, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}