Given a string s, rearrange the characters of s so that any two adjacent characters are not the same.
Return any possible rearrangement of s or return "" if not possible.
Examples
Example 1
Input: s = "aab"
Output: "aba"
Example 2
Input: s = "aaab"
Output: ""
Constraints
1 <= s.length <= 500
s consists of lowercase English letters.
767. Reorganize String
Medium
30 Points
Hash Table
String
Greedy
Sorting
Heap (Priority Queue)
Counting
Given a string s, rearrange the characters of s so that any two adjacent characters are not the same.
Return any possible rearrangement of s or return "" if not possible.