Available question text
Count how many positive integers divide both a and b — compute g = gcd(a, b) and return the number of divisors of g. With 1 ≤ a, b ≤ 1000 this is efficiently done by checking divisors up to sqrt(g).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2427. Number of Common Factors
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source