leetcode 2843. Count Symmetric Integers

https://leetcode.com/problems/count-symmetric-integers/description/

Count Symmetric Integers - LeetCode

 

class Solution:
    def countSymmetricIntegers(self, low: int, high: int) -> int:
        answer = 0
        for num in range(low, high + 1):
            num = str(num)
            if len(num) % 2 == 0:
                left_sum = sum(map(int, num[:len(num)//2]))
                right_sum = sum(map(int, num[len(num)//2:]))
                if left_sum == right_sum:
                    answer += 1
        return answer