René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/interleaving-string","name":"#97 - Interleaving String - LeetCode JavaScript Solutions","description":"Given strings s1, s2, and s3, find whether s3 is formed by an interleaving of s1 and s2. An interleaving of two strings s and t is a configu...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {string} s1\n * @param {string} s2\n * @param {string} s3\n * @return {boolean}\n */\nvar isInterleave = function(s1, s2, s3) {\n  const values = new Array(s1.length + 1).fill().map(() => []);\n\n  if (s1.length + s2.length !== s3.length) {\n    return false;\n  }\n\n  for (let i = 0; i <= s1.length; i++) {\n    for (let j = 0; j <= s2.length; j++) {\n      values[i][j] = i && values[i - 1][j] && s3[i + j - 1] === s1[i - 1]\n        || j && values[i][j - 1] && s3[i + j - 1] === s2[j - 1] || !i && !j;\n    }\n  }\n\n  return Boolean(values.pop().pop());\n};","keywords":"LeetCode 97, #97 - Interleaving String, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}