Problem of the day
New update is available. Click here to update.
Close Longest Substring Without Repeating Characters
MEDIUM
30 mins
43 upvotes Strings
You are not logged in!
Login now to see more stats and your progress.
Topics (Covered in this problem)
Problem solved
Badge
Skill meter
Strings
-
-
Other topics
Problem solved
Badge
Skill meter
Matrices (2D Arrays)
-
-
Linked List
-
-
Sorting
-
-
Binary Search
-
-
Stacks & Queues
-
-
Trees
-
-
Graph
-
-
Dynamic Programming
-
-
Greedy
-
-
Tries
-
-
Arrays
-
-
SQL
-
-
Binary Search Trees
-
-
Heap
-
-
Bit Manipulation
-
-
Solve problems & track your progress
Checkout your overall progress in every topic here
Become 
Sensei
Open the topic and solve more problems associated with it to improve your skills
Check out the skill meter for every topic
See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.
Problem
Submissions
Longest Substring Without Repeating Characters
Contributed by
Anish De
Medium
0/80
Avg time to solve 30 mins
Success Rate 65 %
Share
43 upvotesProblem Statement
Given a string input of length n, find the length of the longest substring without repeating characters i.e return a substring that does not have any repeating characters.
Substring is the continuous sub-part of the string formed by removing zero or more characters from both ends.
Detailed explanation ( Input/output format, Notes, Constraints, Images )
Sample Input 1:
abcabcbb
Sample Output1:
3
Explanation For Sample Input 1:
Substring "abc" has no repeating character with the length of 3.
Sample Input 2:
aaaa
Sample Output 2:
1
Auto
Console