Loading the journal
Loading the journal
Euclidean AlgorithmSolved Nov 10, 2025
Problem
Given two positive integers A and B, find their greatest common divisor (GCD), also known as the highest common factor (HCF).
Reading the solution first feels like progress, but it makes the next similar problem — and the interview version — much harder, because you skipped the part where you figure it out. Give it an honest 20–30 minutes. Stuck? Re-read the pattern, watch the concept video, or try the brute force first.
Hidden: approach · step-by-step visual · solution code