LeetCode 2427: Number of Common Factors Solution

Master LeetCode problem 2427 (Number of Common Factors), a easy challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

2427. Number of Common Factors

Easy

Math Enumeration Number Theory

Problem Explanation

Explanation

To find the number of common factors of two positive integers, we can iterate from 1 to the minimum of the two integers and check if the current number is a common factor of both. If it is, we increment a counter. Finally, we return the counter as the result.

Start with a counter variable count set to 0.
Iterate from 1 to the minimum of a and b (inclusive).
For each number i, check if both a and b are divisible by i.
If they are, increment count.
Return count.

Time complexity: O(min(a, b))
Space complexity: O(1)

Solution Code

class Solution {
    public int numCommonFactors(int a, int b) {
        int count = 0;
        for (int i = 1; i <= Math.min(a, b); i++) {
            if (a % i == 0 && b % i == 0) {
                count++;
            }
        }
        return count;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2427 (Number of Common Factors)?

This page provides optimized solutions for LeetCode problem 2427 (Number of Common Factors) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 2427 (Number of Common Factors)?

The time complexity for LeetCode 2427 (Number of Common Factors) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2427 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 2427 in Java, C++, or Python.

Back to LeetCode Solutions