Longest substring without repeating characters

Given a string value. Find the maximum length of a substring in which all characters are unique.

// Input:  "abcabcbb"
// Output: 3  // substring "abc"