Longest Substring Without Repeating Characters

Google Interview Question

Problem Overview

Difficulty: Medium
LeetCode Pattern: Sliding Window

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

Input: 
· s = “bbbbb”
Output: 
· 1
Explanation: 
· The answer is “b”
· It has length 1

Input: 
· s = "abcabcbb"
Output: 
· 3
Explanation: 
· The answer is "abc"
· It has length 3