GCD and primes
Euclid's algorithm in O(log n), trial division to √n, and the sieve for every prime below n.
This lesson is part of Pro.
Free covers the C and Python courses, the first three DSA topics, the opening system design lessons and the beginner AI lessons, all with the full coach. Pro opens the rest of the library in the FollowtheDamnCode app.