Leetcode in Typescript - 3. Longest Substring Without Repeating Characters

preview_player
Показать описание
Solving Leetcode using Typescript!

0:00:00 - Intro
0:04:54 - Good Example
0:08:40 - Solution 1
0:17:20 - Whiteboarding for a better solution
0:20:37 - Solution 2
Рекомендации по теме
Комментарии
Автор

Very good explanation Mr. Kim, please continue making this series.

rajatpratapsingh
Автор

Thank you!! im a fan of all your vids!

tomblankenship
Автор

I still love your solutions as they describe what you think. "Normal" solutions follow some kind of patterns, which is good in general but it abstracts away the "how" - how do you come up with this algo.

As you asked, another way to solve this is to use sliding window, this problem could be a perfect example for demonstrate the sliding window technique.

crazier
Автор

It's a real pity that such an excellent channel is abandoned (:

evgeniy
welcome to shbcf.ru