<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) {
         unordered_map<char, int> mp;

         for(auto ch : s)
         {
            mp[ch]++;
         }

         priority_queue<pair<int, char>> maxHeap;

         for(auto &[ch, freq] : mp)
         {
            maxHeap.push({freq, ch});
         }
         
         string ans;
         while(maxHeap.size() >= 2)
         {
            auto [freq1, ch1] = maxHeap.top();
            maxHeap.pop();

            auto [freq2, ch2] = maxHeap.top();
            maxHeap.pop();

            ans += ch1;
            ans += ch2;

            if(--freq1 > 0)
                maxHeap.push({freq1, ch1});
            
            if(--freq2 > 0)
                maxHeap.push({freq2, ch2});
         }

         if(!maxHeap.empty())
         {
            auto [freq, ch] = maxHeap.top();
            if(freq > 1)
                return "";
            ans += ch;
         }
         return ans;


         
    }
};
8900