Math Coding Challenges

Compute the sum of all natural numbers from 1 to n using the formula n × (n + 1) / 2. Covers the Gauss arithmetic series and compares O(1) vs O(n) approaches.

Compute 2 raised to the power of n using the pow function or bit-shift operator. Covers exponentiation, the n = 0 edge case, and powers of two in computing.

Compute the factorial of a non-negative integer n (n!). Covers iterative multiplication, the base case 0! = 1, and the growth rate of the factorial function.

Compute the absolute difference between two integers. Introduces absolute value concepts, built-in abs functions, and handles the edge case of equal numbers.

Calculate the area of a circle using A = π × r². Introduces geometric formulas, floating-point arithmetic, and the use of built-in pi constants.

Calculate the circumference of a circle using C = 2 × π × r. Introduces built-in pi constants, floating-point multiplication, and handling a zero radius.

Compute the area of a rectangle given its width and height using the formula A = w × h. Covers basic multiplication and the zero-dimension edge case.

Compute the greatest common divisor (GCD) using the Euclidean algorithm. Covers modulo-based iteration, the GCD(0, x) edge case, and algorithm efficiency.

Compute the least common multiple (LCM) of two integers using the formula LCM = |a × b| / GCD. Covers the GCD-LCM relationship and overflow-safe multiplication.

Test whether a number is prime using trial division up to the square root. Covers the definition of primes, edge cases for 0 and 1, and the sqrt optimization.

Compute the sum of digits of a non-negative integer using modulo and division. Teaches digit extraction, loop control, and the zero edge case.

Find the median of a sorted array. Covers odd/even length handling, integer division for index computation, and the empty-array edge case.

Compute the arithmetic mean (average) of an array of integers. Teaches summation, floating-point division, and handling the empty array edge case.

Count how many times a target value appears in an array. Teaches linear search, iteration, and frequency counting with edge cases for empty arrays and missing targets.

Find the minimum value in an array of integers. Teaches linear scan, tracking the smallest element, and handling empty and single-element arrays.