[Java] Leetcode 3. Longest Substring Without Repeating Characters [Sliding Windows #3]

Показать описание

In this video, I'm going to show you how to solve Leetcode 3. Longest Substring Without Repeating Characters which is related to Sliding Windows.

Here’s a quick rundown of what you’re about to learn:

Course Contents
(0:00) Question Walkthrough
(2:05) Solution Explain
(6:13) Code

In the end, you’ll have a really good understanding on how to solve Leetcode 3. Longest Substring Without Repeating Characters and questions that are similar to this Sliding Windows.

Now, if you want to get good at Sliding Windows, please checkout my Sliding Windows playlist.

Рекомендации по теме

Комментарии

Nice explanation ... generally i code in cpp bt see your explanation

FunForestFood

the nested while loop is not needed, can be replace with 'if'

kseniaeugene

Hi Eric, great videos, thanks for sharing!

Just a quick question(7:30): Why every time we need to convert a string to charArr[], then get the lengh of the array, rather than directly getting the length of the string (e.g. int n = s.length)?

pengx

class Solution {
public int s) {

char arr[] = s.toCharArray();
int n = arr.length;
if (n<2) return n;

// define pointers //

int L =0, R = 0;

// DEFINE TABLE //

Map<Character, Integer> hm = new HashMap<>();

// define max len //
int maxLen = 0;

// find longest substring //
while(R<n) {
// add current element
hm.put(arr[R], hm.getOrDefault(arr[R], 0) + 1);

//check if we meet the condition //
while(hm.getsize()!= R-L+1) {
hm.put(arr[L], hm.get(arr[L]) - 1);
if(hm.get(arr[L] == 0)) {
hm.remove(arr[L]);
}
L++;

}
// update the maxlen //
maxLen = Math.max(maxLen, R- L +1);

// move the R one to the right //

R++;

}
// return maxlen //

return maxLen;
}
}
code is not working . getting error ..

mrb

[Java] Leetcode 3. Longest Substring Without Repeating Characters [Sliding Windows #3]

LeetCode Longest Substring Without Repeating Characters Solution Explained - Java

Longest Substring Without Repeating Characters - LeetCode 3 - Java

Longest Substring Without Repeating Characters - Leetcode 3 - Python

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

Longest Repeating Substring without repeating characters (LeetCode 3) | Two pointer approach

Longest Substring Without Repeating Characters - Leetcode 3 - Java

Leetcode | 3. Longest Substring Without Repeating Characters | Medium | Java Solution

[Java] Leetcode 3. Longest Substring Without Repeating Characters [Sliding Windows #3]

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

LeetCode 3. Longest Substring Without Repeating Characters (Java)

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

Longest Substring Without Repeating Characters - Leetcode 3 - Java

Longest Substring Without Repeating Characters | LeetCode 3 | Coding Interview Tutorial

Leetcode 3. Longest Substring Without Repeating Characters (Java)

LeetCode 3 | Longest Substring without Repeating Characters | Algorithm Explained (Java)

[LEET] code with me #3 (Longest Substring Without Repeating Characters)

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

LeetCode 3 - Longest Substring Without Repeating Characters - Java Solution and Explanation

LeetCode #3: Longest Substring Without Repeating Characters

Most Asked FAANG Coding Question! | Longest Common Prefix - Leetcode 14

Length of longest substring without repeating characters | LeetCode #3 | Top 150 interview question

FAANG Interview Questions - LeetCode Problem 3: Longest Substring Without Repeating Characters Java

3. Longest Substring Without Repeating Characters | Leetcode | Java | Problem 3 | FAANG

Leetcode #3 Longest Substring Without Repeating Characters | JavaScript