PseudoCode for the Longest Substring Problem

longestSubstringProblem.txt

int maxLength
int maxStart
int start
some set S
for each character C in the input string
  check if this character is a repeated character (look for C in S)
  if it is, repeat this:
    look at the first character in my candidate substring.
    remove that character from the front of the substring. (increment start)
    remove that character also from S.
    if that character I just removed was the same as C, break out of this loop.
  add C to S.
  if the set count (s.Count) is greater than maxLength, do:
    set maxLength to the current set count
    set maxStart to start
return the substring starting at maxStart with maxLength characters