dsa2 min read
Ugly Number III
Find the nth number divisible by a, b, or c using binary search with inclusion-exclusion counting formula.
Read →
Lcm
2 articles
dsa4 min read
GCD, LCM, and Extended Euclidean Algorithm
Master GCD/LCM with Euclidean algorithm O(log n) and the Extended Euclidean for modular inverse computation.
Read →