OpenX interview question

longest substring without duplicate characters