Longest Substring Without Repeating Characters - LeetCode 3 - JavaScript

preview_player
Показать описание


Step by step walk through of the solution to the popular Microsoft coding interview question, Longest Substring Without Repeating Characters.

LeetCode 3

JavaScript

0:00 Intro
0:25 Explanation
5:24 Code

#softwareengineering #javascript #leetcode
Рекомендации по теме
Комментарии
Автор

On point explanation without too much of info. Keep uploading thank you

yuvaranikannan
Автор

This explanation is gold!! Please keep posting

agnathavaasi
Автор

Could we use a hash of character to index, then when we find a repeated character, we can move the left pointer to the index after the first occurance of the repeated character ? that would eliminate many re-runs

brianspinos
Автор

Appreciate your effort. Good one, I've solved it already but my solution was using n*n time complexity. Here it's n and I got to know about this sliding window technique. Thanks

sudhakardhayalan
Автор

I did not get why use the set, why don't use a array?

poueeerr
join shbcf.ru