Given a string s, partition it into a sequence of unique segments using a greedy approach by processing each character from left to right:

• Maintain a current segment, initially empty, and a list of recorded segments.

• For each character in s, append it to the current segment.

• If the current segment has not been seen before, append it to the list of recorded segments and reset the current segment to an empty string.

• If the current segment has already been seen, keep it and proceed to the next character.

Return the list of unique segments generated by this process.

Constraints:

• $1 \leq$ s.length $\leq 10^5$

• s contains only lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.