Skip to content
Log inStart studying

DSA learning path

Math & Number Theory

GCD, prime sieves, modular arithmetic and fast exponentiation.

Start with Greatest Common Divisor and LCM

Problems in this path

  1. Greatest Common Divisor and LCM
    Easy · Euclidean Algorithm
    Open
  2. Count Primes with a Sieve
    Medium · Sieve of Eratosthenes
    Open
  3. Fast Modular Exponentiation
    Medium · Binary Exponentiation
    Open
  4. Primality Test
    Easy · Trial Division to Square Root
    Open
  5. Prime Factorisation
    Medium · Repeated Trial Division
    Open
  6. Trailing Zeroes in Factorial
    Easy · Count Powers of Five
    Open
  7. Pascal Triangle Row
    Easy · Binomial Recurrence
    Open
  8. Count Positive Divisors
    Easy · Divisor Pairing
    Open
  9. Extended Euclidean Coefficients
    Hard · Extended Euclidean Algorithm
    Open
  10. Euler Totient Function
    Medium · Prime-Factor Product
    Open

Read first

Number Theory Basics for Algorithms

Use Euclid's algorithm, prime sieves, modular arithmetic and binary exponentiation safely and efficiently.

17 min read