Python Coding
Challenges

Python Basics easy

Collatz steps

Count how many steps the Collatz sequence takes to reach 1 from n.

loops math

1

+10 pts 12m

Python Basics easy

Factorial (iterative)

Compute n! iteratively without recursion.

loops math

+8 pts 8m

Python Basics easy

Power of two?

Return True if n is an exact power of 2.

bitwise math

+8 pts 8m

Python Basics easy

GCD via Euclid

Compute the greatest common divisor of two positive integers.

math recursion

+10 pts 10m

Python Basics easy

Prime checker

Return True if n is a prime number.

math loops

1

+10 pts 10m