Code Challenges

Get better at coding with practice problems.

Coding Challenges

Select a problem, write code, run test cases, and submit your solution.

Math Number Theory Combinatorics

Proficient

Implement the `countWaysToReachSumWithDice` method that counts dice roll combinations that produce the target sum.

Math Number Theory Combinatorics

Intermediate

Implement the `integerBreakMaximumProduct` method that finds the maximum product after splitting an integer into at least two parts.

Math Number Theory Combinatorics

Learner

Implement the `excelColumnNumber` method that converts an Excel column title into its column number.

Math Number Theory Combinatorics

Intermediate

Implement the `countTrailingZerosFactorial` method that counts trailing zeroes in the factorial of n.

Math Number Theory Combinatorics

Learner

Implement the `isUglyNumber` method that checks whether the number has only 2, 3, and 5 as prime factors.

Math Number Theory Combinatorics

Intermediate

Implement the `lcmArrayValues` method that returns the least common multiple of all array values.

Math Number Theory Combinatorics

Learner

Implement the `gcdArrayValues` method that returns the greatest common divisor of all array values.

Math Number Theory Combinatorics

Intermediate

Implement the `sievePrimeCount` method that counts prime numbers up to n using sieve-style marking.

Math Number Theory Combinatorics

Intermediate

Implement the `powIntegerFast` method that calculates an integer power efficiently using fast exponentiation.

Math Number Theory Combinatorics

Learner

Implement the `integerSquareRootFloor` method that returns the floor value of the square root of an integer.

Math Number Theory Simulation

Intermediate

Implement the `isHappyNumber` method that checks whether repeatedly summing the squares of digits reaches 1.

Math Number Theory

Learner

Implement the `isPerfectNumber` method that checks whether a number is equal to the sum of its proper divisors.

Math Number Theory

Learner

Implement the `isArmstrongNumber` method that checks whether a number is equal to the sum of its digits raised to the digit count.

Math Number Theory Bit Manipulation

Intermediate

Implement the `fastPowerModulo` method that calculates base raised to exponent under a given modulo efficiently.

Math Number Theory

Learner

Implement the `lcmOfTwoNumbers` method that returns the least common multiple of two numbers.

Math Number Theory

Learner

Implement the `gcdOfTwoNumbers` method that returns the greatest common divisor of two numbers.

Math Number Theory

Intermediate

Implement the `countPrimeNumbersUpToN` method that counts all prime numbers from 2 up to the given number.

Math Number Theory

Learner

Implement the `isPrimeNumber` method that checks whether the given number is prime.

Array Math Number Theory

Learner

Implement the `findMissingNumberFromOneToN` method that finds the missing value from a sequence that should contain numbers from 1 to n.