Question 7 - Given a string S, print the length of the longest substring with no repeated characters.
**Optimizations: Line 6
A substring can only be max 26 letters long where every letter appears once - adding this min() shortens the number of iterations the program needs to do, 'cause if the substring is longer than 26 there is no way every character can be unique
(Other optimizations exist, but are more complicated)
Question 9 - Given a string S, print the character that appears the most in S.
Line 8 - max count will always be highest for the first occurrence of a character, so we start from i instead of zero