René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/multiply-strings","name":"#43 - Multiply Strings - LeetCode JavaScript Solutions","description":"Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string. Th...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {string} num1\n * @param {string} num2\n * @return {string}\n */\nvar multiply = function(num1, num2) {\n const result = new Array(num1.length + num2.length).fill(0);\n for (let i = num1.length - 1; i >= 0; i--) {\n for (let j = num2.length - 1; j >= 0; j--) {\n const sum = num1[i] * num2[j] + result[i + j + 1];\n result[i + j] += Math.floor(sum / 10);\n result[i + j + 1] = sum % 10;\n }\n }\n return result.join('').replace(/^0+(?!$)/, '');\n};\n\n// one-liner alternative that breaks the rules:\n/**\n * @param {string} num1\n * @param {string} num2\n * @return {string}\n */\nvar multiply = function(num1, num2) {\n return ((BigInt(num1) * BigInt(num2))).toString();\n};","keywords":"LeetCode 43, #43 - Multiply Strings, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}