Problem 6: 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 Explanation: The answer is "abc", with the length of 3.