Apply Operations to Make String Empty

Given a lowercase string s, repeatedly perform rounds where you remove the first occurrence of each letter 'a' to 'z' (if present) until s becomes empty; return the string state immediately before the final round. The challenge is to determine which characters survive all but the last pass efficiently for s up to 5e5 in length.