Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.