Commit30ac3db

sambabib

committed

added js solution to _3

1 parentbde6a61 commit30ac3dbCopy full SHA for 30ac3db

File tree

+25

-1

lines changed

+25

-1

lines changed

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -7,4 +7,5 @@ out/`
`7`	`7`	`*.vscode/`
`8`	`8`	`src/main/java/com/fishercoder/solutions/_99999RandomQuestions.java`
`9`	`9`	`src/main/java/com/fishercoder/solutions/_Contest.java`
`10`		`-.project`
	`10`	`+.project`
	`11`	`+bin`

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,23 @@`
	`1`	`+functionlengthOfLongestSubstring(s){`
	`2`	`+// Using the "sliding window" data structure.`
	`3`	`+// Create a javascript set to store unique characters.`
	`4`	`+letcharSet=newSet();`
	`5`	`+letleft=0;// Left pointer of the sliding window.`
	`6`	`+letmaxLength=0;`
	`7`	`+`
	`8`	`+// This moves the right pointer of the sliding window.`
	`9`	`+for(letright=0;right<s.length;right++){`
	`10`	`+// If the character at the right pointer is already in the set, move the left pointer.`
	`11`	`+while(charSet.has(s[right])){`
	`12`	`+charSet.delete(s[left]);`
	`13`	`+left++;`
	`14`	`+}`
	`15`	`+// Add the current character at the right pointer to the set.`
	`16`	`+charSet.add(s[right]);`
	`17`	`+`
	`18`	`+// Update the maximum length of substring without repeating characters.`
	`19`	`+maxLength=Math.max(maxLength,right-left+1);`
	`20`	`+}`
	`21`	`+`
	`22`	`+returnmaxLength;`
	`23`	`+}`

Comments

(0)