René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/special-binary-string","name":"#761 - Special Binary String - LeetCode JavaScript Solutions","description":"Special binary strings are binary strings with the following two properties:  The number of 0's is equal to the number of 1's. Eve...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {string} s\n * @return {string}\n */\nfunction makeLargestSpecial(s) {\n  if (s.length <= 2) return s;\n\n  let count = 0;\n  let start = 0;\n  const specials = [];\n\n  for (let i = 0; i < s.length; i++) {\n    count += s[i] === '1' ? 1 : -1;\n\n    if (count === 0) {\n      specials.push('1' + makeLargestSpecial(s.slice(start + 1, i)) + '0');\n      start = i + 1;\n    }\n  }\n\n  return specials.sort().reverse().join('');\n}","keywords":"LeetCode 761, #761 - Special Binary String, Hard, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}