benchmarks.wiki

benchmarks.wiki / Public workspace

LiveCodeBench / 2998 / count-symmetric-integers

Problem

Scored by the benchmark’s own harness. Use the benchmark’s own evaluation harness to check your work.

question title

count-symmetric-integers

question content

You are given two positive integers low and high.
An integer x consisting of 2 * n digits is symmetric if the sum of the first n digits of x is equal to the sum of the last n digits of x. Numbers with an odd number of digits are never symmetric.
Return the number of symmetric integers in the range [low, high].
 
Example 1:

Input: low = 1, high = 100
Output: 9
Explanation: There are 9 symmetric integers between 1 and 100: 11, 22, 33, 44, 55, 66, 77, 88, and 99.

Example 2:

Input: low = 1200, high = 1230
Output: 4
Explanation: There are 4 symmetric integers between 1200 and 1230: 1203, 1212, 1221, and 1230.

 
Constraints:

1 <= low <= high <= 10^4

starter code

Code

class Solution:
    def countSymmetricIntegers(self, low: int, high: int) -> int:

contest date

2023-09-03T00:00:00

contest id

weekly-contest-361

difficulty

easy

platform

leetcode

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See how this is scored Scored by the benchmark’s own harness

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

upstream_id / Original problem ID
2998
task_id
e96a3e3c-c171-54e1-8350-39d08e873f3b
task_key
release~5fv1--test--2998
task_revision_id
4
config / split
release_v1 / test

Official source

initial import