Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2843. Count Symmetric Integers
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source