<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) {
        int n=s.length();

        unordered_map<int,int> mp;
        for(auto it: s) mp[it]++;

        int maxFreq=0;
        char maxChar;
        for(auto it: mp){
            if(maxFreq<it.second){
                maxChar=it.first;
                maxFreq=it.second;
            }
        }

        int ind;
        for(ind=0; ind<n; ind+=2){
            s[ind]=maxChar;
            maxFreq--;
            if(!maxFreq){
                mp.erase(maxChar);
                break;
            } 
        }

        if(maxFreq) return "";

        for(auto it: mp){
            char currChar=it.first;
            int currFreq=it.second;
            while(currFreq){
                ind=ind+2>=n?1: ind+2;
                s[ind]=currChar;
                currFreq--;
            }
        }

        return s;
    }
};
8300