<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 {
public:
    vector<int> rearrangeBarcodes(vector<int>& nums) {
        int n = nums.size();
        unordered_map<int,int>mpp;
        for(auto it:nums){
            mpp[it]++;
        }
        set<pair<int,int>>st;
        for(auto it:mpp){
            st.insert({it.second,it.first});
        }
        int pos =0;
        for(auto it = st.rbegin(); it != st.rend(); ++it){
            int count = it->first;
            int value = it->second;
            for(int i=0;i<count;++i ,pos+=2){
                if(pos>=nums.size()) pos =1;
                nums[pos] = value;
            }
        }
        return nums;
    }
};
49300