Available question text
Count how many integers in the inclusive range [low, high] (given as decimal strings up to 100 digits) have every pair of adjacent digits differ by exactly 1 and no leading zeros, returning the result modulo 1e9+7. The core challenge is handling enormous bounds efficiently (typically via digit-DP or equivalent) to count valid numbers up to high and subtract those below low.
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 2801. Count Stepping Numbers in Range
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source