String - 10: Longest sub-string length with no repeating characters | Java Implementation

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

Solution:
- We take a Map, which'll give me info about unique characters present, Map key will be character & value will be the last position of that character
- We'll take a max_length variable, where we'll store the solution
- we'll take two variable start & end, which'll be the window of substring with no repeating characters. At starting, both start & end will be at zero
- Now we iterate the string & check if character already present in map then my next window will be from the next character of that character so we get the index point 'start' to that index + 1
- max_length will be updated by end - start + 1
- At last we return, max_length as answer

Time Complexity: O(n)
Space Complexity: O(n)

Do Watch video for more info

CHECK OUT CODING SIMPLIFIED

★☆★ VIEW THE BLOG POST: ★☆★

I started my YouTube channel, Coding Simplified, during Dec of 2015.
Since then, I've published over 400+ videos.

★☆★ SUBSCRIBE TO ME ON YOUTUBE: ★☆★

★☆★ Send us mail at: ★☆★

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

Комментарии

Super speechless. very clear ..every usecase is covered.

ramavempaty

Hi Bro, This is one of best explanation on internet for this problem because you are clearly representing the steps using the table at bottom.

dearvivekkumar

Great explanation.. Highly appreciated😊

vidhibansal

Thank you sir, it was very helpful !!!

meghnasingh

Good explanation.

You missed updating the index value for "a" and "b"

venkateswarank

amazing vids and make more based on Leetcode problem

sincelife

Good work sir
Can you please add some videos on questions of graphs?? Till now you have only taught DFS and BFS but we want you to teach questions on graph too, Please add them👃🏻👃🏻

AyushKumar-vhpg

String - 10: Longest sub-string length with no repeating characters | Java Implementation

String - 10: Longest sub-string length with no repeating characters | Java Implementation

LeetCode Longest Substring Without Repeating Characters Solution Explained - Java

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

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

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

Longest Substring Without Repeating Characters | Amazon

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

Searching Algorithm - (Q&A -10) - Longest Substring Without Repeating Characters

Leetcode: Longest substring without repeating characters.

String 10: Longest Distinct characters in a string | Must Do Coding Questions | GeeksForGeeks

Longest Substring Without Repeating Characters - Leetcode 3 - String | Animation | Visualization

Leetcode 3. Longest Substring Without Repeating Characters

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

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

Longest Palindromic Sub-string (LeetCode 5) | Full solution with examples | Study Algorithms

Program to Find Longest Sub string Without Repeating Characters

Longest Palindromic Substring - Python - Leetcode 5

Longest Substring of Two String with Python

Find The Longest Substring Without Repeating Characters Java | LeetCode Interview | InterviewDOT

Longest Common Substring | Dynamic Programming | Intuition and explanation w/ animations

Java Program to find longest substring without repetition| Amazon coding interview questions

Google Engineer Explains - LeetCode #3 - Longest Substring Without Repeat - Solution (Python)

L8. Longest Repeating Character Replacement | 2 Pointers and Sliding Window Playlist

Longest Substring Without Repeating Characters - Amazon Coding Interview Question