SubSequence of non-repeating chars Given a string, find the length of the longest substring without repeating characters. For example: - For “ABDEFGABEF”, the longest substring are “BDEFGA” and “DEFGAB”, length 6. - For “BBBB” the longest substring is “B”, with length 1.