<p>Given a string <code>s</code>, rearrange the characters of <code>s</code> so that any two adjacent characters are not the same.</p>

<p>Return <em>any possible rearrangement of</em> <code>s</code> <em>or return</em> <code>&quot;&quot;</code> <em>if not possible</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> s = "aab"
<strong>Output:</strong> "aba"
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> s = "aaab"
<strong>Output:</strong> ""
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 500</code></li>
	<li><code>s</code> consists of lowercase English letters.</li>
</ul>

class Solution {
public:
    string reorganizeString(string s) {
        map<char, int> mp;
        for (auto i : s) mp[i]++;
        vector<pair<int, char>> v;
        int n = s.size();
        
        for (auto i : mp) {
            if (i.second > (n + 1) / 2) return "";
            v.push_back({i.second, i.first});
        }
        sort(v.rbegin(), v.rend());

        string ans = s;
        int idx = 0;

        for (auto& [freq, ch] : v) {
            while (freq--) {
                ans[idx] = ch;
                idx += 2;
                if (idx >= n) idx = 1;  
            }
        }
        
        return ans;
    }
};

9100