3597. Partition String

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.

class Solution {
public:
    vector<string> partitionString(string s) {
        string p = "";
        unordered_set<string> us;
        vector<string> res;
        auto push = [&](string& s) {
            if(us.count(s)) return;
            us.insert(s);
            res.push_back(s);
            s = "";
        };
        for(int i = 0; i < s.length(); i++) {
            p.push_back(s[i]);
            push(p);
        }
        return res;
    }
};