3992. Rearrange String to Avoid Character Pair

You are given a string s and two distinct lowercase English letters x and y.

Rearrange the characters of s to construct a new string t such that:

• t is a permutation of s.
• Every occurrence of y appears before every occurrence of x in t.

Return any valid string t.

class Solution {
public:
    string rearrangeString(string s, char x, char y) {
        for(int i = 0, j = 0; i < s.length(); i++) {
            if(s[i] == y) swap(s[i], s[j++]);
        }
        return s;
    }
};