euclidean algorithm - great common divisor
Understand the use of Euclidean algorithms in finding the greatest common divisor. Includes examples of naive and recursive approaches in Go, and an application in solving a string division problem on LeetCode.
05 Jul 2024
1 min read