# Rearrange Barcodes: Walkthrough

Rearrange Barcodes shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Count frequencies and always place the current most common leftover barcode, skipping adjacent equals, with a max-heap of remaining counts.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n log k).

## Common mistake

Scanning left to right without a heap, which gets stuck when a frequent value clusters.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob AI.