Numbers coding challenges

Practise numbers with 46 coding challenges, from easy to hard. Every challenge runs in your browser with instant tests, an AI review of your code and community solutions to compare.

Easy · 30 Medium · 15 Hard · 1

Skills you'll practise: DivisibilityConditionsDigit extractionDigit sumLoopsRecurrencesSieve of EratosthenesSquare root boundBit shiftsDivisor pairsLookup tablesModulo
  • Python · C++ · C#
  • Automated tests
  • AI code review
  • Community solutions
341
Challenges
245
Solutions shared
9
Languages

All challenges

Search by name or topic, or filter by difficulty.

46 challenges
Easy

Binomial Coefficient

Count the ways to choose k items out of n (n choose k).

You'll learn Pascal's triangleOverflow-safe arithmetic
BeginnerCS1High schoolLoopsNumbersmath
No solutions yet
Medium

Number to Words

Spell a whole number in English words, such as "one hundred twenty-three".

You'll learn Lookup tablesDecomposing numbers
CS1High schoolIntermediateLoopsNumbersmath
No solutions yet
Easy

Perfect Square Check

Decide whether an integer is the square of a whole number.

You'll learn Integer square rootEdge cases
BeginnerCS1High schoolLoopsNumbersmath
No solutions yet
Medium

Prime Factorization

Break a number into its prime factors, listed from smallest to largest with repetition.

You'll learn Trial divisionSquare root bound
CS1High schoolIntermediateLoopsNumber-theoryNumbersPrimesmath
No solutions yet
Easy

Base Converter

Convert a number written in one base (2 to 36) to another base.

You'll learn Positional notationRepeated division
BeginnerCS1High schoolLoopsNumbersmath
No solutions yet
Easy

Count Primes in a Range

Count how many prime numbers lie between two bounds, both included.

You'll learn Sieve of EratosthenesRange counting
BeginnerCS1High schoolLoopsNumber-theoryNumbersPrimesmath
No solutions yet
Medium

Goldbach Partition

Write an even number as the sum of two primes, using the smallest possible first prime.

You'll learn Primality testingSearching from the smallest candidate
CS1Dynamic-programmingHigh schoolIntermediateLoopsNumber-theoryNumbersPrimesmath
No solutions yet
Medium

Gray Code

List the n-bit reflected binary Gray code, where neighbors differ in exactly one bit.

You'll learn XORBit shifts
Bit manipulationCS1High schoolIntermediateLoopsNumbersmath
No solutions yet
Medium

Amicable Pair

List every amicable pair whose two numbers are both at most a limit.

You'll learn Divisor-sum sievePair checks
CS1High schoolIntermediateLoopsNumber-theoryNumbersPrimesmath
No solutions yet
Medium

Modular Exponentiation

Compute base to the power exponent, modulo a number, with fast exponentiation.

You'll learn Exponentiation by squaringModular arithmetic
CS1High schoolIntermediateLoopsNumber-theoryNumbersPrimesmath
No solutions yet
Medium

Derangements

Count the arrangements of n items where nothing stays in its original place.

You'll learn RecurrencesCombinatorics
CS1Dynamic-programmingHigh schoolIntermediateLoopsNumbersmath
No solutions yet
Medium

Nth Prime

Return the nth prime number, counting 2 as the first.

You'll learn Prime testingSieve of Eratosthenes
CS1High schoolIntermediateLoopsNumber-theoryNumbersPrimesmath
No solutions yet
Easy

Twin Primes

List all twin prime pairs (p, p + 2) up to a limit.

You'll learn Sieve of EratosthenesPairing neighbours
BeginnerCS1High schoolLoopsNumber-theoryNumbersPrimesmath
No solutions yet
Easy

Abundant, Perfect or Deficient

Classify a number as abundant, perfect or deficient by the sum of its proper divisors.

You'll learn Divisor pairsSquare root bound
BeginnerCS1High schoolLoopsNumber-theoryNumbersPrimesmath
No solutions yet
Easy

Lucas Numbers

Return the nth Lucas number, the Fibonacci-like sequence that starts 2, 1.

You'll learn LoopsRecurrences
BeginnerCS1High schoolLoopsNumbersmath
No solutions yet
Medium

Catalan Numbers

List the Catalan numbers C(0) to C(n).

You'll learn Dynamic programmingRecurrences
CS1Dynamic-programmingHigh schoolIntermediateLoopsNumbersmath
No solutions yet
Medium

Integer to Roman

Write a whole number from 1 to 3999 as a Roman numeral.

You'll learn Greedy algorithmsLookup tables
CS1High schoolIntermediateLoopsNumbersmath
No solutions yet
Easy

Tribonacci

Return the nth tribonacci number, where each term is the sum of the three before it.

You'll learn LoopsRolling variables
BeginnerCS1High schoolLoopsNumbersmath
No solutions yet