Search in the row#4669
In a sequence made up of lowercase Latin alphabet characters, your task is to identify the longest subsequence where all characters are distinct and appear consecutively.
The input consists of a sequence distributed across multiple lines. Each line contains up to characters. The overall length of the sequence does not exceed characters.
The output should be a single line containing the first longest subsequence that has no repeating characters.
Example 1