366. Longest Unique Character Substring

Given a string s, find the length of the longest substring that contains no repeating characters.

Example:
Input: s = "abcabcbb" Output: 3 because the longest substring is "abc".

Run this challenge interactively in Python or JavaScript when the app loads.