<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:
    def reorganizeString(self, s: str) -> str:
        count, res  =  collections.Counter(s) , []
        pq = [( -v , k) for k, v in count.items()] 
        heapq.heapify(pq)
        
        prev_c , prev_count  = '', 0 
        
        while pq:
            
            count , c =  heapq.heappop(pq)
            res+= [c]
            
            if prev_count <  0 :
                heapq.heappush(pq ,( prev_count ,  prev_c ) )
            
            count +=1 
   
            prev_c, prev_count = c, count 
        
        
        res = ''.join(res )
            
        if len(res )!= len(s):
            return ''
        return res
        
        
16700