Problem - Reorganize String

Given a string, rearrange it so no two adjacent characters are the same. Return any valid arrangement or empty string if impossible. For $s = "aab"$, return $"aba"$. For $s = "aaab"$, return $""$ (impossible).

Here's similar to task scheduling.

Think about when rearrangement is possible and what determines the answer.