Given a string s, find the length of the longest substring without repeating characters.
Input: s = 'abcabcbb'
Output: 3 ('abc')
Input: s = 'bbbbb'
Output: 1 ('b')
Input: s = 'pwwkew'
Output: 3 ('wke')Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features