#1054

Distant Barcodes

specialist · 890 · lc medium +31 · verified · 48.7% accepted · 1,347 likes · top 35%

Description

You are given an integer array barcodes representing a row of barcodes in a warehouse. Rearrange the barcodes so that no two adjacent barcodes are equal. It is guaranteed a valid arrangement exists.

Example 1:

Input: barcodes = [1,1,1,2,2,2]

Output: [2,1,2,1,2,1]

Example 2:

Input: barcodes = [1,1,1,1,2,2,3,3]

Output: [1,3,1,3,1,2,1,2]

Code

1

2

3

class Solution:
    def rearrangeBarcodes(self, barcodes: List[int]) -> List[int]:

class Solution:
    def rearrangeBarcodes(self, barcodes: List[int]) -> List[int]: