Regarding the above solution: would it not be O(n)? Iterating through the list of ascii characters is O(1) – it always iterates through the 26 characters of the alphabet. Thus, checking the input of length n results in O(26 * n) = O(n). Dissenters welcome.