Dsa
Sliding Window
Easy
Longest Unique Character Substring
Given a string, find the length of the longest substring without repeating characters. You must perform this in O(n) time complexity.
Input:
- The first line contains a single string S (1 <= |S| <= 10^6) consisting of ASCII characters.
Output:
- Output the length of the longest substring without repeating characters.
Example:
Input:
abcabcbb
Output:
3
Key concepts
sliding_windowstringunique
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now