Longest Substring Without Repeating Characters

Given a string s, determine the length of the longest contiguous substring that contains no duplicate characters. Input Format: A single string s. Output Format: An integer representing the length of the longest substring with all unique characters. Examples: The longest qualifying substring is "abc". The longest qualifying substring is "b". The longest qualifying substring is "wke". Constraints: String length n: 0 <= n <= 5 * 10^4. The string consists of ASCII characters.