Objective

Implement count_digit_steps, a function that counts adjacent increasing digit pairs.

Steps

• Create digit_steps.py.
• Expose def count_digit_steps(text: str) -> int:.
• A valid pair is made of two adjacent characters that are both digits.
• The second digit must be exactly one greater than the first digit.
• Pairs may overlap, so 123 contains two valid pairs.
• 90 is not valid; there is no wraparound.
• Non-digit characters break adjacency.

Objective

Implement count_digit_steps, a function that counts adjacent increasing digit pairs.

Steps

• Create digit_steps.py.
• Expose def count_digit_steps(text: str) -> int:.
• A valid pair is made of two adjacent characters that are both digits.
• The second digit must be exactly one greater than the first digit.
• Pairs may overlap, so 123 contains two valid pairs.
• 90 is not valid; there is no wraparound.
• Non-digit characters break adjacency.