Learn AI Create the Future — with Pranay
Main site

LeetCode solutions

2998. Count Symmetric Integers

My accepted Python solution to LeetCode problem 2998, Count Symmetric Integers, running in 871ms.

  • Difficulty: Easy
  • Python
  • Runtime 871ms
  • Memory 17.2MB

Read the problem on LeetCode View on GitHub

The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.

Python

Accepted on LeetCode — runtime 871ms, memory 17.2MB, accepted 2025-12-30.

python
class Solution:
    def countSymmetricIntegers(self, low: int, high: int) -> int:
        count = 0
        for num in range(low, high + 1):
            s = str(num)
            n = len(s)
            # Only check even digit numbers
            if n % 2 == 0:
                half = n // 2
                first_half_sum = sum(int(d) for d in s[:half])
                second_half_sum = sum(int(d) for d in s[half:])
                if first_half_sum == second_half_sum:
                    count += 1
        return count

Source