Kotlin coding challenges

340 challenges you can solve in Kotlin, from first loops to graphs, dynamic programming and machine learning. Write your code in the browser, run the tests instantly and get an AI review.

Easy · 193 Medium · 118 Hard · 29

Skills you'll practise: Nested loopsDigit extractionCountingLoopsString splittingConditionsSieve of Eratosthenes2D listsArithmeticBig number arithmeticCycle detectionDivisibility
  • 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.

340 challenges
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

Smallest of Three

Return the smallest of three integers.

You'll learn ComparisonsVariables
BeginnerCS1ConditionsFunctionsHomeworkIntro programmingStudent-beginner
No solutions yet
Easy

Inverted Right Triangle

Print a right triangle upside down: n stars on the first row, one on the last.

You'll learn Nested loopsCounting down
BeginnerCS1High schoolLoopsNested-loopsPatterns
No solutions yet
Hard

Digit Factorial Chains

Count starting numbers whose digit factorial chain has exactly a given number of distinct terms.

You'll learn Cycle detectionMemoization
AdvancedCompetitive-programmingNumber-theoryProject Euler stylemath
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

Shipping Cost Function

Complete the function that prices a package from its weight in ounces and the delivery speed.

You'll learn Ceiling divisionFunction parameters
BeginnerCS1ConditionsFunctionsHomeworkIntro programmingStudent-beginner
No solutions yet
Easy

Self Powers Tail

Find the last k digits of 1^1 + 2^2 + ... + n^n.

You'll learn Modular arithmeticFast exponentiation
BeginnerBig integersCompetitive-programmingNumber-theoryProject Euler stylemath
No solutions yet
Easy

Remove Gray From RGB

Remove the gray part of an RGB color by subtracting the smallest channel from all three.

You'll learn Minimum of valuesInput validation
BeginnerBit manipulationCS1ConditionsFunctionsHomeworkIntro programmingStudent-beginner
No solutions yet
Easy

Smallest Multiple

Find the smallest positive number that every integer in a range divides evenly.

You'll learn Greatest common divisorLeast common multiple
BeginnerCompetitive-programmingConditionsFinanceFunctionsNumber-theoryProject Euler stylemath
No solutions yet
Medium

Sparse Grid

Keep a mostly empty grid as a list of its non-zero cells and answer get, count, row sum and column removal operations.

You'll learn Sparse storageMap keys
AP Computer ScienceCS1ClassesGridsHomeworkIntermediateIntro programmingMatricesOOPStudent-beginner
No solutions yet
Medium

Quadratic Primes

Find the quadratic n² + an + b that gives the longest run of primes from n = 0.

You'll learn Primality testingBrute-force search
Competitive-programmingIntermediateNumber-theoryPrimesProject Euler stylemath
No solutions yet
Medium

Counting Sundays

Count the months in a range of years that begin on a Sunday.

You'll learn Date arithmeticModular arithmetic
Competitive-programmingDates and timesIntermediateNumber-theoryProject Euler stylemath
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
Easy

Distinct Powers

Count the different values of a to the power b for a and b in a range.

You'll learn Perfect powersSets
BeginnerCompetitive-programmingNumber-theoryProject Euler stylemath
No solutions yet
Medium

Champernowne Digits

Find digits at given positions of the string 123456789101112... made by writing out the counting numbers.

You'll learn Digit countingBlock skipping
Competitive-programmingIntermediateNumber-theoryProject Euler stylemath
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

Ticket Lottery Winners

Count how many lottery tickets matched 0, 1, 2, ... of the winning numbers.

You'll learn Set membershipFrequency counts
CS1GamesHomeworkIntermediateIntro programmingStudent-beginner
No solutions yet
Medium

Truncatable Primes

List the primes up to a limit that stay prime as digits are removed from either end.

You'll learn Primality testingNumber truncation
Competitive-programmingIntermediateNumber-theoryPrimesProject Euler stylemath
No solutions yet