You are given a string s and two distinct lowercase English letters x and y.
Rearrange the characters of s such that every occurrence of y appears before every occurrence of x.
Return any such rearranged string.
Constraints:
s.length
s consists of lowercase English letters.
x and y are lowercase English letters.
x y
You are given a string s and two distinct lowercase English letters x and y.
Rearrange the characters of s such that every occurrence of y appears before every occurrence of x.
Return any such rearranged string.
Constraints:
s.length
s consists of lowercase English letters.
x and y are lowercase English letters.
x y