Leetcode: Distant Barcodes

Distant Barcodes

Similar Problems:

In a warehouse, there is a row of barcodes, where the i-th barcode is barcodes[i].

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

Example 1:

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

Example 2:

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


  1. 1 <= barcodes.length <= 10000
  2. 1 <= barcodes[i] <= 10000

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.

  • Solution: XXX

General Thinkings:

Key Observations:

Walk Through Testdata

// Blog link: https://code.dennyzhang.com/distant-barcodes


Share It, If You Like It.

Leave a Reply

Your email address will not be published.