#3597
Partition String
medium · 58.7% accepted · 69 likes · top 55%
hash table · string · trie · simulation
Description
Given a string s, partition it into unique segments according to the following procedure:
- Start building a segment beginning at index 0.
- Continue extending the current segment character by character until the current segment has not been seen before.
- Once the segment is unique, add it to your list of segments, mark it as seen, and begin a new segment from the next index.
- Repeat until you reach the end of s.
Return an array of strings segments, where segments[i] is the ith segment created.
Solution