Last active
July 21, 2020 04:05
-
-
Save spiterman/00021bae5586113adb64963170febd9f to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function minimumWindowSubstring(str, substr) { | |
let lettersSeen = {}; | |
let lettersNeeded = {}; | |
let lettersMissing = 0; | |
for(let i = 0; i < substr.length; i++) { | |
if(substr[i] in lettersNeeded){ | |
lettersNeeded[substr[i]] += 1; | |
} else { | |
lettersNeeded[substr[i]] = 1; | |
lettersSeen[substr[i]] = 0; | |
lettersMissing += 1; | |
} | |
} | |
let fast = 0; | |
let slow = 0; | |
let result = [-Infinity, Infinity]; | |
for(fast; fast < str.length; fast++) { | |
if(str[fast] in lettersNeeded) { | |
lettersSeen[str[fast]] += 1; | |
if(lettersSeen[str[fast]] === lettersNeeded[str[fast]]) { | |
lettersMissing -= 1; | |
} | |
} | |
while(lettersMissing === 0) { | |
if(fast - slow < result[1] - result[0]) { | |
result[0] = slow | |
result[1] = fast | |
} | |
if(str[slow] in lettersNeeded) { | |
lettersSeen[str[slow]] -= 1; | |
if(lettersSeen[str[slow]] < lettersNeeded[str[slow]]) { | |
lettersMissing += 1; | |
} | |
} | |
slow++; | |
} | |
} | |
return result[0] === -Infinity ? "" : str.slice(result[0], result[1] + 1); | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
This is really helpful @spiterman :)