René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/split-with-minimum-sum","name":"#2578 - Split With Minimum Sum - LeetCode JavaScript Solutions","description":"Given a positive integer num, split it into two non-negative integers num1 and num2 such that:  The concatenation of num1 and num2 is a perm...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number} num\n * @return {number}\n */\nvar splitNum = function(num) {\n  const digits = String(num).split('').sort((a, b) => a - b);\n  let num1 = '';\n  let num2 = '';\n\n  for (let i = 0; i < digits.length; i++) {\n    if (i % 2 === 0) {\n      num1 += digits[i];\n    } else {\n      num2 += digits[i];\n    }\n  }\n\n  return Number(num1) + Number(num2);\n};","keywords":"LeetCode 2578, #2578 - Split With Minimum Sum, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}