Leetcode 2843. Count Symmetric Integers

Count how many integers in [low, high] have an even number of digits and whose first half of digits sums to the same value as the last half (numbers with odd digit count are excluded). Given the constraint (high ≤ 10^4), a direct per-number digit-sum check is efficient.