Sponsored Reserved space — layout preview until AdSense is connected
easy +10 pts

Collatz steps

Count iterations until 1.

Implement `collatz(n: int) -> int`. Rules: if n is even, n = n // 2; if odd, n = 3*n + 1. Count steps until n == 1. Return 0 for n == 1 (already there).

Constraints

1 ≤ n ≤ 10^6

Example

>>> collatz(6)
8
10 points ~12 min

Recent Submissions

No submissions yet — hit Run Tests to try!

Hints

Use a while loop; count increments on each step.
Python 3
All tests passed!
Test Results
Press Ctrl+Enter or click Run Tests to execute your code.
Sponsored Reserved space — layout preview until AdSense is connected