Maximum Equal Frequency

Find the longest prefix of an array such that by removing exactly one element from that prefix, all remaining distinct values have the same occurrence count. The core challenge is to reason about element frequencies (and the distribution of those frequencies) to detect prefixes that can be balanced by a single removal.