<p>In a warehouse, there is a row of barcodes, where the <code>i<sup>th</sup></code> barcode is <code>barcodes[i]</code>.</p>

<p>Rearrange the barcodes so that no two adjacent barcodes are equal. You may return any answer, and it is guaranteed an answer exists.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> barcodes = [1,1,1,2,2,2]
<strong>Output:</strong> [2,1,2,1,2,1]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> barcodes = [1,1,1,1,2,2,3,3]
<strong>Output:</strong> [1,3,1,3,1,2,1,2]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= barcodes.length &lt;= 10000</code></li>
	<li><code>1 &lt;= barcodes[i] &lt;= 10000</code></li>
</ul>

class Solution:
    def rearrangeBarcodes(self, barcodes: List[int]) -> List[int]:
        freq = [0] * 10001
        maxFreqCode = 0
        for code in barcodes:
            freq[code] += 1
            if freq[code] > freq[maxFreqCode]:
                maxFreqCode = code
        i, n = 0, len(barcodes)
        ans = [0] * n
        for code in range(10001):    
            if code == 0:
                code = maxFreqCode
            for _ in range(freq[code]):
                if i >= n:
                    i = 1
                ans[i] = code
                i += 2
            freq[code] = 0    
        return ans
18400