I was wondering if it was possible to solve the longest substring problem without using memory with just O(n) time compleixity