René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/reorganize-string","name":"#767 - Reorganize String - LeetCode JavaScript Solutions","description":"Given a string s, rearrange the characters of s so that any two adjacent characters are not the same. Return any possible rearrangement of s...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {string} s\n * @return {string}\n */\nvar reorganizeString = function(s) {\n  const charCount = new Map();\n  for (const char of s) {\n    charCount.set(char, (charCount.get(char) || 0) + 1);\n  }\n\n  const maxHeap = [...charCount.entries()]\n    .sort((a, b) => b[1] - a[1]);\n\n  if (maxHeap[0][1] > Math.ceil(s.length / 2)) {\n    return '';\n  }\n\n  const result = [];\n  let index = 0;\n\n  while (maxHeap.length) {\n    const [char, count] = maxHeap.shift();\n    for (let i = 0; i < count; i++) {\n      result[index] = char;\n      index += 2;\n      if (index >= s.length) index = 1;\n    }\n  }\n\n  return result.join('');\n};","keywords":"LeetCode 767, #767 - Reorganize String, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}