# LeetCode: Number of Common Factors Solution

*Iterate*

## Approach

Iterate from

1

to max of a

and b

and count the number of divisible## Implementation

1var commonFactors = function (a, b) {2 return Array.from(3 { length: Math.max(a, b) + 1 },4 (_, i) => a % i === 0 && b % i === 05 ).filter(Boolean).length6}

## References

## Similar problems

## Comments

Loading comments...

## Tags

leetcode

math

array

## Apply and earn a $2,500 bonus once you're hired on your first job!

Clients from the Fortune 500 to Silicon Valley startups

Choose your own rate, get paid on time

From hourly, part-time, to full-time positions

Flexible remote working environment

A lot of open JavaScript jobs!!

**Fact corner:** Referred talent are 5x more likely to pass the Toptal screening process than the average applicant.

**Still hesitate?** Read HoningJS author's guide on dealing with Toptal interview process.