Minimize Colorful Sequence Rearrangement Solution

Problem Statement

Given an array of integers `colors` where each element represents one of three distinct colors, determine the minimum number of steps to rearrange the elements into a specific sequence where the same colors are grouped together.

Constraints

• 1 <= n <= 1,000,000
• n is a multiple of 3