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
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
This explanation is gold!! Please keep posting
Got some new walk-throughs coming out shortly
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
On point explanation without too much of info. Keep uploading thank you
Thank for the comment, appreciate it!
brief and precise.
thank you!
Thanks for watching 👍
Top Quality Content !
Thanks Chaitanya, and good luck with any interviews you have!
@@AlgoJS Keep uploading!
thanks :)
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
Thank you
I did not get why use the set, why don't use a array?
Set only store unique values