Technical Interview Question - 3. Longest Substring without Repeating Characters

Thanks for the vid! I was looking for an explanation on sliding windows more than the actual question and this was perfect. Also had a thought, could it be worth returning max if s.length() - left <= maxlength after the left++ if you're haven't got enough elements to update max?

Thanks. Very understandable and a good code.

Thanks, that was a great and crystal clear explanation

@Daniel Su There is one more optimized solution explained in leet code. It would have been nice if you had added that.

Thank you so much, it is really best explanation for the problem.

Good explanation.

can you share your Python code for this?

Thank you!

Thanks for the explanation, but I'm having a hard time grasping why the Time Complexity would be O(1). If we know the possible values ahead of time then its constant space complexity? This is because of 26 != the input N?

for the naive solution complexity, you are not checking n with every other letter but only checking forward to the end of string, so shouldnt the complexity be n!*n ?

love you bro!

10/10, the illustrations really helped

great video. please make more videos like this. Just go through as many common lc questions as you can.

this makes more sense than just looking at a final solution. thanks for making.

good shit

Why is the time complexity O(26n) in the second approach?

Good explanation ...... but why does every one does this in Java 😅😇

Wonderfully explained Daniel. Keep it going! Thank you.

please do more ur so good

Very helpful tutorial. Plz keep making it.

Very nice explanation of the algorithm. Thanks.

12.39 any substring without repeating characters will not be longer than pw . can u pls explain why

Very clear! Thank you!

Please upload more interview questions videos

Hey hey great