Longest Substring Without Repeating Characters | LeetCode 3 | Coding Interview Tutorial

preview_player
Показать описание
Longest Substring Without Repeating Characters solution: LeetCode 3

AFFILIATE LINKS
If you're interested in learning algorithms, these are great resources.

💲 All coupons and discounts 💲

Longest Substring Without Repeating Characters | LeetCode 3 | Coding Interview
#longestsubstringwithoutrepeatingcharacters #leetcode #algorithms #terriblewhiteboard #codinginterview

Click the time stamp to jump to different parts of the video.
00:00 Title
00:06 Problem readout
01:23 Whiteboard solution
11:46 Coding solution
17:16 Result and outro
Рекомендации по теме
Комментарии
Автор

If there are any videos you'd like me to make or if you have any ideas on how to optimize this solution, let me know!

TerribleWhiteboard
Автор

Seriously your explanations are one of the most powerful and simplest explanations ever found on youtube so far .While most videos shy away from the in depth working of the code line by line and just point out the algorthim in general . Your way of explanations are really very catchy and very simplistic. Keep up the good work .

aritralahiri
Автор

I will watch all your videos and comment so that the youtube algorithm will show your video to more audiences. You are the best. I hope your channel reaches to more audience.

Shiva-zyjq
Автор

Thanks a lot! Loved the way you explained the logic, solution and the code. Very very helpful!!! Please keep adding more videos.

srinadhp
Автор

bro, I keep commenting on every single video I watch on your channel. you deserve more credit.

suri
Автор

As someone suggested, please consider discussing space and time complexities too!

srinadhp
Автор

Please make more leetcode problems. Your teaching style is good

Shiva-zyjq
Автор

Thank you so much! This has helped me a lot.
I had a lot of trouble understanding this sliding window technique. God bless you.

historyvspresent
Автор

I feel grateful to your work!! and could you give us a solution about the problem "Construct Binary Tree from Inorder and Postorder Traversal" in Leetcode? I would be really appreciate about it

Chili_Charlie
Автор

Hey Thanks for making this video! It's really helpful

kawaljitsingh
Автор

thank you! so easy to understand after watching this!!

felipesales
Автор

I'd be really helpful to discuss the runtime complexity and space complexity as well! Very helpful videos!!!

catalintorge
Автор

Really awesome explanation, came here straight from the LC comments section.
Just one point though, It would be great if you would have explained the Hashmap method too, (maybe in another video) reason being that it that method is more generalized for sliding window problems of this sort.
Anyway, amazing video.
- Cheers

srinidhibhat
Автор

Definitely better than my approach using an object. Same process longer approach...

StaceyWilsonlosangeles
Автор

Thank you for this. Great and clear explanation

bielchristo
Автор

So clear! Love your iPad teaching style!

timhuang
Автор

thanks alot keep going on this methodology, most of the others, explain the code not the methodology, so again thanks alot

hamoodelholandy
Автор

such an easy to understand solution thanks so muchhh

urmomapollo
Автор

Btw, the link to the Udemy course for data structures & algorithms is not working anymore - "Sorry, this course is no longer accepting enrollments." What was the name and author of the course ?

ragu
Автор

Loved the explanation and approach as alaways.But one doubt:
Why use sets as before adding an element to set(same/different) you are first checking if that element exists in the set.So correct me if i wrong..i think with this approach any other data structure like maps can be used

tejaskaria