@@ -0,0 +1,670 @@
+// Avoidance of using HashMap can make it a lot quicker%0A%0Apublic class Solution %7B%0A    public int lengthOfLongestSubstring(String s) %7B%0A        int%5B%5D mark = new int%5B128%5D;%0A        int idx = 0, tmp = 0, res = 0, left = -1;%0A        %0A        for (int i = 0; i %3C s.length(); i++) %7B%0A            idx = (int)s.charAt(i);%0A            if (mark%5Bidx%5D %3E 0 && mark%5Bidx%5D %3E left) %7B%0A                tmp = i - mark%5Bidx%5D + 1;%0A                left = mark%5Bidx%5D;%0A            %7D else %7B%0A                tmp++;%0A            %7D%0A            %0A            mark%5Bidx%5D = i + 1;%0A            %0A            if (tmp %3E res) %7B%0A                res = tmp;%0A            %7D%0A        %7D%0A        %0A        return res;%0A    %7D%0A%7D%0A

Create LongSubWRC_004.java