Leetcode 2808. Minimum Seconds to Equalize a Circular Array

Given a circular array where each second every element can take its own or a neighbor's value (so values propagate outward one step per second), find the minimum seconds to make all elements equal. This reduces to, for each distinct value, computing the maximum circular distance any index is from the nearest occurrence of that value and taking the minimum of those maxima.