Dsa
Sliding Window
Medium
Longest Substring with Distinct Characters
Given a string, find the length of the longest substring with all distinct characters.
Input:
A single string s, (1 <= |s| <= 10^5).
Output:
An integer representing the length of the longest substring with all distinct characters.
Example:
Input:
abcabcbb
Output:
3
Key concepts
sliding_windowstringhashmap
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