Longest Substring Without Repeating Characters

#3
Medium
Sliding Window
O(n)
O(min(m,n))
Amazon
Microsoft
Facebook
Adobe
View on LeetCode

Problem Description

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