Longest Substring Without Repeating Characters | Leet code 3 | Theory explained + Python code

This video is a solution to Leet code 3, Longest Substring Without Repeating Characters. I explain the question, go over how the logic / theory behind solving the question and finally solve it using Python code.
Comment below if you have a better solution to this problem!
Let me know if you have any feedback and don't forget to subscribe for more videos!
Time stamps:
0:00 Question Explained
1:05 Solution Explained
14:14 Python Code
Code:
leetcode.com/explore/challeng...)
More leetcode questions solved:
• Add and Search Word - ...

[@JumaleAbdi-tu3zh]

Bro this is brilliant
I struggled with this question for days and now I got the logic. Your explanations are just phenomenal, thank you

[@prasantainment3001]

you explained this problem better than most of them

[@jahirraihanjoy3466]

i was not looking for solution . Actually i wanted to understand the logic behind this Algorithm.
Thanks dude for your help.
Trust me i've watched 2 -3 videos to understand the logic but by your's one i get it very clearly.
Thanks again :).

[@saianishmalla2646]

I'm glad it helped!!!

[@anupamasingh9858]

This was so easy to understand! Thank you :)

[@nk19087]

this was truly so well explained! Thank you!!

[@vikasviki7490]

You Rock Buddy.

[@MynamedidntFitDonkey]

nice bro

[@ramizrizwan3057]

This is so helpful- thank you

[@PriyaAmar848]

Very nice explanation . Keep doing more videos

[@stunning-computer-99]

amazing explanation.

[@ishayadav001]

Great video!!

[@saianishmalla2646]

ty!!!!

[@duchieuvn8358]

good work, thank you bro

[@MarlonCuna]

what a goat

[@gauravpatil7977]

explained very well bro! can u tell me how to come up with solutions of these kind of complex problems?