René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/minimum-factorization","name":"#625 - Minimum Factorization - LeetCode JavaScript Solutions","description":"Given a positive integer num, return the smallest positive integer x whose multiplication of each digit equals num. If there is no answer or...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number} num\n * @return {number}\n */\nvar smallestFactorization = function(num) {\n  if (num < 2) return num;\n\n  const digits = [];\n  for (let divisor = 9; divisor > 1; divisor--) {\n    while (num % divisor === 0) {\n      digits.push(divisor);\n      num /= divisor;\n    }\n  }\n\n  if (num > 1) return 0;\n\n  let result = 0;\n  for (const digit of digits.reverse()) {\n    result = result * 10 + digit;\n    if (result > 2**31 - 1) return 0;\n  }\n\n  return result;\n};","keywords":"LeetCode 625, #625 - Minimum Factorization, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}