Загрузка страницы

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.

Notes and Code - https://github.com/GoogleEngineerExplains/LeetCode-Notes/blob/master/LeetCode%20%23003%20-%20Medium%20-%20Longest%20Substring%20Without%20Repeating%20Characters.py

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

Видео Google Engineer Explains - LeetCode #3 - Longest Substring Without Repeat - Solution (Python) канала Google Engineer Explains
Показать
Комментарии отсутствуют
Введите заголовок:

Введите адрес ссылки:

Введите адрес видео с YouTube:

Зарегистрируйтесь или войдите с
Информация о видео
24 мая 2020 г. 1:18:17
00:17:21
Другие видео канала
Google Engineer Explains - LeetCode #4 - Median of Two Sorted Arrays - Solution (Python)Google Engineer Explains - LeetCode #4 - Median of Two Sorted Arrays - Solution (Python)Python Programming Practice: LeetCode #3 -- Longest Substring Without Repeating CharactersPython Programming Practice: LeetCode #3 -- Longest Substring Without Repeating CharactersGoogle Engineer Explains - LeetCode #5 - Longest Palindromic Substring - Solution (Python)Google Engineer Explains - LeetCode #5 - Longest Palindromic Substring - Solution (Python)Google Engineer Explains - LeetCode #9 - Palindrome Number - Solution (Python)Google Engineer Explains - LeetCode #9 - Palindrome Number - Solution (Python)Google Engineer Explains - LeetCode #1 - Two Sum - Solution (Python)Google Engineer Explains - LeetCode #1 - Two Sum - Solution (Python)Google Engineer Explains - LeetCode #8 - String to Integer (atoi) - Solution (Python)Google Engineer Explains - LeetCode #8 - String to Integer (atoi) - Solution (Python)Sliding Window Technique - Algorithmic Mental ModelsSliding Window Technique - Algorithmic Mental ModelsLongest Common Subsequence (2 Strings) - Dynamic Programming & Competing SubproblemsLongest Common Subsequence (2 Strings) - Dynamic Programming & Competing SubproblemsSliding Window Algorithm - Longest Substring Without Repeating Characters (LeetCode)Sliding Window Algorithm - Longest Substring Without Repeating Characters (LeetCode)Google Engineer Explains - LeetCode #2 - Add Two Numbers - Solution (Python)Google Engineer Explains - LeetCode #2 - Add Two Numbers - Solution (Python)Longest Substring Without Repeating Characters - PythonLongest Substring Without Repeating Characters - PythonGoogle Engineer Explains - LeetCode #7 - Reverse Integer - Solution (Python)Google Engineer Explains - LeetCode #7 - Reverse Integer - Solution (Python)Technical Interview Question - 3. Longest Substring without Repeating CharactersTechnical Interview Question - 3. Longest Substring without Repeating CharactersAmazon Interview question | Add two number | leetcode 2| pythonAmazon Interview question | Add two number | leetcode 2| pythonLongest Substring Without Repeating Characters | LeetCode 3 | Coding Interview TutorialLongest Substring Without Repeating Characters | LeetCode 3 | Coding Interview TutorialBasic Calculator II | Leet code 227 | Theory explained + Python codeBasic Calculator II | Leet code 227 | Theory explained + Python codeLeetcode - Longest Palindromic Substring (Python)Leetcode - Longest Palindromic Substring (Python)[Leetcode 676] Reorganize String (English Version) Python | Greedy | Ladboy Coding[Leetcode 676] Reorganize String (English Version) Python | Greedy | Ladboy CodingPython Programming Practice: LeetCode #2 -- Add Two NumbersPython Programming Practice: LeetCode #2 -- Add Two NumbersGoogle Engineer Explains - LeetCode #6 - ZigZag Conversion - Solution (Python)Google Engineer Explains - LeetCode #6 - ZigZag Conversion - Solution (Python)
Яндекс.Метрика