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

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

Length of longest substring without repeating characters

This is the #LeetCode question number 3 under medium section.

#JavaInterview #leetcode

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

Комментарии

A hashset makes more sense here. Using arraylist will cause the solution to have quadratic complexity, but a hashset has O(1) lookup therefore using a hashset the algorithm would have O(n) time and space complexity

Garensonic

Well explained mam, for beginner's easily can understand

avinashabhi

🛠 Optimizations:
✅ HashSet instead of List → O(1) lookup instead of O(n)
✅ end - start instead of list.size() → Cleaner logic
✅ Space Complexity: O(n) (worst case, all unique characters)

public static int string) {
int start=0, end=0, max_length=0;
Set<Character> set= new HashSet<>();
while(end<string.length()){

set.add(string.charAt(end));
end++;
max_length=Math.max(max_length, end-start);
}else{

start++;
}

}
return max_length;
}

KapilDevmurari

Good explaination!💫

Edit: there is one more test case that is to check if string is null, we will have to return zero just noticed it after submitting it.

nikhilkumarjamwal

Please tell how to print, the longest substring along with count

karthikshan

class Solution {
public int label) {
int end = 0;
int maxLength = 0;
List<Character> list = new ArrayList<>();

while (end < label.length()) {
boolean isContained =
if (!isContained) {
list.add(label.charAt(end));
end++;
maxLength = Math.max(maxLength, list.size());
} else {
list.removeFirst();
}
}
return maxLength;
}
}

i think the start variable unnecessary

duylong

Voice is clear and loud like lady army officer 👍👍👍 and concept also clear

Coding-Just

this is the easiest explanation i found so far

thakurprathiksinghrajput

thank you so much mam, your concept in this particular problem is easily understandable

ayush.

Give graphical explanation for "pwwkew"

_SANJAYM

Using List time complexity is O(n2) .. replace with Set to have O(n) time complexity
Correct me if wrong. Thanks

rupeshpatil

Try for this test case :'abcbad'

saikiran

Todo code ko zoom out bhi ker diya kero Madam 🙏

Ford_

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

Longest Substring Without Repeating Characters - Leetcode 3 - Python

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

LeetCode Longest Substring Without Repeating Characters Solution Explained - Java

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

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

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

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

Leetcode 3. Longest Substring Without Repeating Characters

Longest Substring Without Repeating Characters - LeetCode 3 Python

LeetCode #3: Longest Substring Without Repeating Characters

Longest Substring Without Repeating Characters - LeetCode 3 - JavaScript

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

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

Longest Substring Without Repeating Characters | Leetcode Problem | Fast Python Solution

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

Longest substring without repeating character solution | leetcode - 3 | harishnote

Longest Substring Without Repeating Characters - LeetCode 3 - Sliding Window

Length of Longest Substring - Leet Code 3 - TypeScript

Length of the Longest Substring Without Repeating Characters

Longest Substring Without Repeating Characters - 3. LeetCode - C#

String: Longest Substring Without Repeating Characters | Medium Level | day 1 #coding #programming

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

Longest Substring without Repeating Characters