Longest Substring Without Repeating Characters | Live Coding with Explanation | Leetcode - 3

preview_player
Показать описание
Detailed explanation for Longest Substring Without Repeating Character Leetcode 3

To support us you can donate

Check out our other popular playlists:

If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful.

#coding #leetcode #programminglife #programmingisfun #programmer #tech #software #codinglife #leetcode
  1. Algorithms Made Easy
  2. leetcode
  3. programming
  4. leetcode java
  5. leetcode problems
  6. coding
Рекомендации по теме
Longest Substring Without 0:06:46

Longest Substring Without Repeating Characters - Leetcode 3 - Python

LeetCode Longest Substring 0:08:40

LeetCode Longest Substring Without Repeating Characters Solution Explained - Java

Sliding Window Algorithm 0:00:59

Sliding Window Algorithm Explained Clearly | Longest Substring Without Repeating Characters Leetcode

L3. Longest Substring 0:23:09

L3. Longest Substring Without Repeating Characters | 2 Pointers and Sliding Window Playlist

Longest Substring Without 0:12:04

Longest Substring Without Repeating Characters - Leetcode 3 - Sliding Window (Python)

LeetCode Exercise In 0:38:17

LeetCode Exercise In Java - Longest Substring Without Repeating Characters - FAST Solution

Sliding Window Algorithm 0:10:22

Sliding Window Algorithm - Longest Substring Without Repeating Characters (LeetCode)

LeetCode #3: Longest 0:08:12

LeetCode #3: Longest Substring Without Repeating Characters

Longest Substring Without 0:06:13

Longest Substring Without Repeating Characters - LeetCode 3 - Sliding Window

LONGEST SUBSTRING WITHOUT 0:15:53

LONGEST SUBSTRING WITHOUT REPEATING CHARACTERS | LEETCODE 3 | PYTHON SOLUTION

Leetcode - Longest 0:06:15

Leetcode - Longest Substring Without Repeating Characters (Python)

Longest Substring Without 0:06:43

Longest Substring Without Repeating Characters - LeetCode 3 - JavaScript

Longest Substring Without 0:18:24

Longest Substring Without Repeating Characters - LeetCode 3 - Java

Longest Substring Without 0:10:50

Longest Substring Without Repeating Characters - LeetCode 3 Python

Python Programming Practice: 0:20:21

Python Programming Practice: LeetCode #3 -- Longest Substring Without Repeating Characters

Leetcode - Longest 0:06:55

Leetcode - Longest Substring Without Repeating Characters (Python)

[Решение на Java] 0:11:16

[Решение на Java] 3. Longest Substring Without Repeating Characters. Задача LeetCode для Amazon......

Length of longest 0:12:34

Length of longest substring without repeating characters | LeetCode problem number 3

Leetcode 3. Longest 0:15:49

Leetcode 3. Longest Substring Without Repeating Characters

Longest Substring Without 0:12:22

Longest Substring Without Repeating Characters | Brute Force Approach | Sliding Window Algorithm

Java Program To 0:08:07

Java Program To Find Longest Substring Without Repeated Character | Ashok IT

Longest substring without 0:09:24

Longest substring without repeating characters | leetcode | python | leetcode 3 | Amazon

Longest Substring Without 0:10:21

Longest Substring Without Repeating Characters | Решение на Python | LeetCode 3

Longest substring without 0:06:31

Longest substring without repeating characters | C++ Placement Course | Lecture 26.3

Комментарии
Автор

We hope you all are enjoying our videos!!! Don't forget to leave a comment!!! Please like the video to support us!!!

Questions you might like:

Struggling in a question??

Leave in a comment and we will make a video!!!🙂🙂🙂

AlgorithmsMadeEasy
Автор

really hard to understand please provide more explanation

atularya
Автор

"gbcjkancb" in this case, the output shows "jkanc" not "jkancb" because 'b' is already in the map. don't you need to update map?

Infp_recovery_room
Автор

C++ Code :


class Solution {
public:
// Sliding Window
// TC : O(n)
// SC :O(min(m, n)); m - length of charset
int s) {
int n = s.size();
int maxLen = 0;
// Store last seen index of each character
unordered_map<char, int> charIndex;

int start = 0;
for (int end = 0; end < n; end++) {
if (charIndex.find(s[end]) != charIndex.end()) {
start = charIndex[s[end]];
maxLen = max(maxLen, end - start);
}
charIndex[s[end]] = end;
maxLen = max(maxLen, end - start);
}

return maxLen;
}
};

lrchoudhary
Автор

Please code in c++ language instead of Java

pallavithukral