Google Engineer Explains - LeetCode #3 - Longest Substring Without Repeat - Solution (Python)

In this video, I discuss my solution for approaching LeetCode #3 - Longest Substring Without Repeat as well as space and time complexity. I also discuss how you could output the first or last instance of the given longest string.

01:16 Solution Overview
06:13 Implementation
10:08 Time and Space Complexity
13:41 Extra Credit

[rustams]

This is great. The breakdowns before and after the code are invaluable and hard to find elsewhere.

[mc]

Great videos, Kevin! I noticed you always write out examples in the docstring, almost pedantically. This is great for learning, but would you recommend spending a lot of time on this in say a Google interview where time is limited?

[anirudhparmar]

the best ..video but difficulty with sound .