filmov
tv
Longest Substring Without Repeating Characters | LeetCode #3 | Python Solution

Показать описание
Leetcode is an online platform where we can practice our coding skills.
In this series of "Leetcode Solution in python" where we will discuss all the popular leetcode problems with Theoretical and coding explanation, with a numerical explanation.
Today we will be discussing the problem Longest Substring Without Repeating Characters.
TimeStamps
_____________
1. Problem Statement: ( 00:36 )
2. Explanation of problem statement: ( 00:43 )
3. Brute-Force Solution: ( 01:30 )
4. Sliding-window Solution: ( 01:58 )
5. Algorithm Explanation with example: ( 04:18 )
6. Time complexity: ( 10:26 )
Resources
____________
In this series of "Leetcode Solution in python" where we will discuss all the popular leetcode problems with Theoretical and coding explanation, with a numerical explanation.
Today we will be discussing the problem Longest Substring Without Repeating Characters.
TimeStamps
_____________
1. Problem Statement: ( 00:36 )
2. Explanation of problem statement: ( 00:43 )
3. Brute-Force Solution: ( 01:30 )
4. Sliding-window Solution: ( 01:58 )
5. Algorithm Explanation with example: ( 04:18 )
6. Time complexity: ( 10:26 )
Resources
____________