Maximum length of a substring without repeating characters

You are given a string s. You need to determine the length of the longest contiguous fragment of this string in which each character appears only once. Example: Input: s = "abcabcbb" Output: 3