@@ -0,0 +1,759 @@
+public class Solution %7B%0A    public int lengthOfLongestSubstring(String s) %7B%0A                Set%3CCharacter%3E currentCharacters = new HashSet%3CCharacter%3E();%0A        int left = 0;%0A        int max = 0;%0A        for (int right = 0; right %3C s.length(); right++) %7B%0A            Character rightCharacter = s.charAt(right);%0A            if (currentCharacters.contains(rightCharacter)) %7B%0A                while (currentCharacters.contains(rightCharacter)) %7B%0A                    currentCharacters.remove(s.charAt(left++));%0A                %7D%0A            %7D else %7B%0A                if (max %3C (right - left + 1)) %7B%0A                    max = right - left + 1;%0A                %7D%0A            %7D%0A            currentCharacters.add(rightCharacter);%0A        %7D%0A%0A        return max;%0A    %7D%0A%7D%0A

3. Longest Substring Without Repeating Characters