LeetCode #3: Longest Substring Without Repeating Characters

preview_player
Показать описание
A step-by-step visualization of #LeetCode question 3: Longest Substring Without Repeating Characters

0:00 Intro
0:21 Brute Force Solution
1:23 Sliding Window Solution
4:17 Code Walkthrough

#coding #programming #algorithms
Рекомендации по теме
Комментарии
Автор

I usually never comment on videos but this was outstanding! Seriously beats reading a bunch of articles and blog posts. You explained things so clearly and concisely. Thanks a lot for putting the time and effort into this.

jaeyonglee
Автор

GOAT! I love everything about this video. The beauty of the opening screen is pure gold!

EmaPF
Автор

Neetcode’s solution wasn’t very clear and you helped me a lot, thank you!

dnm
Автор

I been through many videos on sliding windows and this question. You sir, explained it the best. Good job and I will browse other videos !

groundingtiming
Автор

amazing, simple and clean) thanks for sharing

ShahriyarRzayev
Автор

Great bro... Out of many videos, yours is easily understandable.

Asma-rjmm
Автор

Amazing solution! I really appreciate the explanation you've used through an example and plugged in the values into the code explaining what each line of code does! God Bless

arnavshukla
Автор

Thank you very much! I have been subscribed to you for a while now, your visualisation and coherent explanation is very helpful! Keep it up! Thanks 🙏🏾

dnm
Автор

beautiful solution, easy to understand

Ricalrax
Автор

i stumbled on this solution first and am so glad I did....

shallommicah
Автор

thanks for solution, it was a great help

gamersrock
Автор

Please do neetcode 150 then, too 50 from faang all time questions, your approach is needed in the swe community! Thanks!

dnm
Автор

Man you are amazing and I would say "the best"

mrtalhaaa
Автор

Your explaination is excellent, very very helpfull. Do you have any premium course on Algorithm for more problem solving brother???

ShihabHasan-bz
Автор

Manifesting 1M subscriber for Algo Engine

hemantkumar
Автор

A humble request please do complete blind75 series

hemantkumar
Автор

Hi, great video! I'm wondering if we actually need a dictionary. As all of the operations on a hash set are O(1) in average, couldn't we just use a hash set to keep track of all of the characters involved in the current sliding window and add/remove elements from the set as we move the sliding window?

lucasrango
Автор

Why don't you just move the left pointer straight over to where the right pointer left off?

frommarkham
Автор

how much time did you take to learn all this thing

lalitmeenea
Автор

Thanks for this useful explanation but I think you made a small mistake in your code. In the true branch if your if statement you do not update the seen dict like you do in the else branch.

patrikkovacs