Skip to content

problem1.md

Latest commit

 

History

History
11 lines (8 loc) · 284 Bytes

problem1.md

File metadata and controls

11 lines (8 loc) · 284 Bytes

Problem 1: Unique Grapheme Spans (Longest Substring Without Repeating Characters)

Problem Statement

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

Input Format

  • A string s.

Example

Input: s = "abcabcbb"
Output: 3