Longest Substring Without Repeating Characters — Medium Coding Interview Question

Given a string s, find the length of the longest substring without repeating characters.

Example

Input: s = "abcabcbb"

Output: 3

Explanation: The answer is "abc", with the length of 3.

Constraints

• 0 ≤ s.length ≤ 5 × 10⁴
• s consists of English letters, digits, symbols, and spaces.

Topics & Companies

Topics: sliding-window, hash-map

Asked by: Amazon, Google, Meta, Microsoft, Apple, Bloomberg, Adobe, Uber

Optimal Solution Complexity

Time complexity: O(n). Space complexity: O(min(m, n)).

Practice more

• All DSA Problems
• DSA Patterns