Rearrange String k Distance Apart

Given a string and integer k, rearrange the characters so that identical characters are at least k positions apart (return an empty string if no valid arrangement exists). The core challenge is a scheduling/frequency problem: you must greedily place the most frequent characters while enforcing a k-length cooldown (often modeled with a max-heap and a waiting queue) to satisfy spacing constraints.