Leetcode 3012. Minimize Length of Array Using Operations

Given an array of positive integers, you may repeatedly pick two positive elements, append their remainder a % b, and remove the originals; compute the minimum possible final array length. The core challenge is reasoning about number-theoretic invariants (Euclidean-algorithm-like reductions) and how producing zeros — which cannot participate further — limits how much the array can be shrunk.