LeetCode in C# (CSharp) Challenge: 3. Longest Substring Without Repeating Characters.

In this YouTube video, we'll embark on a journey to solve a classic LeetCode problem: finding the length of the longest substring without repeating characters. We'll explore both a brute force method and an optimized solution in C#.

CHAPTERS
0:00 - Introduction & Description of Challenge
0:35 - Examples Breakdown
1:38 - Substring vs. Subsequence
2:34 - Brute Force Approach
3:15 - Pseudocode (Brute Force Approach)
5:27 - Beginning our Brute Force Solution
7:09 - What is a HashSet?
9:05 - HashSet vs. Dictionary
9:42 - Hash-Based Collections
10:43 - What is a Hash Code?
12:10 - Back to our Brute Force Solution
21:16 - Math.Max() Method
22:33 - Brute Force Approach Solution completed
23:40 - Two-Pointer Technique Demo
28:06 - Pseudocode (Optimized Approach)
30:06 - Beginning our Optimized Solution
35:16 - Optimized Approach Solution completed
35:30 - Outro

Видео LeetCode in C# (CSharp) Challenge: 3. Longest Substring Without Repeating Characters. канала Jump Point Security