Back to Problem Library Part of Senior TypeScript Roadmap →

Sliding Window

Longest Substring Without Repeating Characters

mediumLeetCodeJS / TS9 tests

Problem Statement

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

Examples

Example 1:
Input: s = "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.

Example 2:
Input: s = "bbbbb"
Output: 1

JavaScript & TypeScript starter code included

Run this as a live interview

Practice solo

9 test cases. No second person needed.