Given a string, find the length of the longest substring without repeating characters.

Examples:

Given "abcabcbb", the answer is "abc", which the length is 3.

Given "bbbbb", the answer is "b", with the length of 1.

Given "pwwkew", the answer is "wke", with the length of 3. Note that the answer must be a substring, "pwke" is a subsequence and not a substring.

Solution:

Use two-pointer and HashTable to solve.

Keep p1 at the beginning of the substring and move p2, add characters to hash table and keep the index as value,

if map contains s[p2] then need to  move p1 to the right of the duplicated char index, then update the index of map[s[p2]] to p2;

also p1 and p2 should only move forward;

ex) "abba" when p1=0, p2 = 2, we met the second 'b' then p1 should move to 2, and p2 stay at 2.

then when p1=2, p2=3 we met the second a, p1 should never move back to index 1 to start over;

Before come up with this solution, my solution was to clear the map and move p1 to the right of the first duplicated char, and same to p2 then go through again and add to map,

This method worst case runtime is O(n2), so exceeded the time Limited

 public class Solution {

     public int LengthOfLongestSubstring(string s) {

         if(string.IsNullOrEmpty(s))

         {

             return ;

         }

         int l = s.Length;

         int max = ;

         int p1=;

         int p2=;

         Dictionary<char,int> map = new Dictionary<char,int>();

         while(p2<l)

         {

             if(!map.ContainsKey(s[p2]))

             {

                 map.Add(s[p2], p2);

             }

             else

             {

                 if(p1<=map[s[p2]])

                 {

                    p1=map[s[p2]]+;

                 }

                  map[s[p2]]= p2;

             }

             max= Math.Max(max, p2-p1+);

             p2++;

         }

         return max;

     }

 }