Longest Unique Substring

Problem Statement: Write a function that takes a string s and returns the length of the longest substring without repeating characters.

Input:

A string s of lowercase English letters, with length between 1 and 10,000.
Output:

An integer representing the length of the longest substring with all unique characters.

Question

Longest Unique Substring

Problem Statement: Write a function that takes a string s and returns the length of the longest substring without repeating characters.

Input:

A string s of lowercase English letters, with length between 1 and 10,000.
Output:

An integer representing the length of the longest substring with all unique characters.

Uber