v0.40: Create exercises. Challenge the community.

count_digit_steps

Your mission

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

See it in action

count_digit_steps("4567")

Expected result

Your checklist

For your own tracking. Tests grade your code.

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.

More examples

count_digit_steps("4q56")

Expected result

Constraints

Expected files

digit_steps.py

Allowed functions

None. Write every helper yourself.

count_digit_steps

Your mission

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

See it in action

count_digit_steps("4567")

Expected result

Your checklist

For your own tracking. Tests grade your code.

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.

More examples

count_digit_steps("4q56")

Expected result

Constraints

Expected files

digit_steps.py

Allowed functions

None. Write every helper yourself.

Tests

Run the tests to grade your code

Build your code, then check each test here. Open a result to inspect its output.

Build

01Overlapping runWaiting

02Non-digit breaks adjacencyWaiting

03Descending digitsWaiting

04Full increasing runWaiting

05No 9 to 0 wraparoundWaiting

06Repeated digitsWaiting

07Empty stringWaiting

count_digit_steps

Your mission

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

See it in action

count_digit_steps("4567")

Expected result

Your checklist

For your own tracking. Tests grade your code.

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.

More examples

count_digit_steps("4q56")

Expected result

Constraints

Expected files

digit_steps.py

Allowed functions

None. Write every helper yourself.

count_digit_steps

Your mission

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

See it in action

count_digit_steps("4567")

Expected result

Your checklist

For your own tracking. Tests grade your code.

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.

More examples

count_digit_steps("4q56")

Expected result

Constraints

Expected files

digit_steps.py

Allowed functions

None. Write every helper yourself.

Tests

Run the tests to grade your code

Build your code, then check each test here. Open a result to inspect its output.

Build

01Overlapping runWaiting

02Non-digit breaks adjacencyWaiting

03Descending digitsWaiting

04Full increasing runWaiting

05No 9 to 0 wraparoundWaiting

06Repeated digitsWaiting

07Empty stringWaiting

v0.40: Create exercises. Challenge the community.

Meet Studio →