René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/permutation-in-string","name":"#567 - Permutation in String - LeetCode JavaScript Solutions","description":"Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise. In other words, return true if one of s1�...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {string} s1\n * @param {string} s2\n * @return {boolean}\n */\nvar checkInclusion = function(s1, s2) {\n  const getCharCode = c => c.charCodeAt() - 'a'.charCodeAt();\n  const isMatch = (a1, a2) => a1.every((n, i) => a2[i] === n);\n\n  if (s1.length > s2.length) {\n    return false;\n  }\n\n  const map1 = new Array(26).fill(0);\n  const map2 = new Array(26).fill(0);\n  for (let i = 0; i < s1.length; i++) {\n    map1[getCharCode(s1[i])]++;\n    map2[getCharCode(s2[i])]++;\n  }\n\n  for (let i = 0; i < s2.length - s1.length; i++) {\n    if (isMatch(map1, map2)) return true;\n    map2[getCharCode(s2[i + s1.length])]++;\n    map2[getCharCode(s2[i])]--;\n  }\n\n  return isMatch(map1, map2);\n};","keywords":"LeetCode 567, #567 - Permutation in String, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}