Longest Substring Without Repeating Characters

Find the longest stretch of a string with no repeated letter. Grow a window to the right, and when a letter repeats, shrink it from the left until the repeat is gone.