Longest Substring Without Repeating Characters | C++ | LeetCode | 3 Approaches Explained | Amazon

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

Given a string, find the length of the longest substring without repeating characters.

Input: "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.

Input: "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.

Input: "pwwkew"
Output: 3
Explanation: The answer is "wke", with the length of 3.

Note that the answer must be a substring, "pwke" is a subsequence and not a substring.

***Correction in Brute Force Method RETURN STATEMENT

return m? m : len; //If m is still 0 (due to no repeated characters in the string), return the default value of len (=1)

Thanks Phuc Lam, for pointing this out :)

#decodethecodewithakm #ankitkumarmishradtc #decodethecode #easeintocodingalongwithcomplexities

You can follow me on the following social media sites:
Facebook:

Instagram:

LinkedIn:

Twitter:

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

Комментарии

There's another mistake in the brute force method. Suppose you have a string say "abbb". In the brute force method when i=0, m=4, since 'a' never repeats again. However the substring "bbbb" has all repeating characters

MrApplefreaker

I don’t think the brute force actually works because if there is no repeat in the string you will always return count which is 0. You never enter the if condition to update count.

ryanlam

Thanks for the efforts. The sliding window code doesn't work when the input "pwwkew", it returns 4 while the output should be 3

EngMohannad

please do something about static sound!

rahulveersingh

Longest Substring Without Repeating Characters | C++ | LeetCode | 3 Approaches Explained | Amazon

Longest Substring Without Repeating Characters - Leetcode 3 - Python

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

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

LeetCode Longest Substring Without Repeating Characters Solution Explained - Java

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

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

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

LeetCode #3: Longest Substring Without Repeating Characters

Java Code to Find the Longest Substring Without Repeating Characters

Longest Substring Without Repeating Characters - LeetCode 3 - Java

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

[Animated] LeetCode 3 Longest Substring Without Repeating Characters | Blind 75 | Sliding Window

LONGEST SUBSTRING WITHOUT REPEATING CHARACTERS | LEETCODE 3 | PYTHON SOLUTION

Longest Substring Without Repeating Characters - LeetCode 3 Python

Longest Substring Without Repeating Characters - LeetCode 3 - Sliding Window

Longest Substring Without Repeating Characters Python Solution - LeetCode #3

Longest Substring Without Repeating Characters - LeetCode 3 - JavaScript

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

Longest Substring With Without Repeating Characters | Variable Size Sliding Window

Leetcode - Longest Substring Without Repeating Characters (Python)

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

LeetCode Q2: Longest Substring Without Repeating Characters Using Sliding Window and HashMap in Java

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

Amazon - Longest Substring Without Repeating Characters - Leetcode 3