Find the Number of Good Pairs I

Problem Description

You are given 2 integer arrays nums1 and nums2 of lengths n and m respectively. You are also given a positive integer k. A pair (i, j) is called good if nums1[i] is divisible by nums2[j] * k (0 <= i <= n - 1, 0 <= j <= m - 1). Return the total number of good pairs.

Key Insights

• A good pair is defined based on divisibility.
• We need to check each combination of elements from nums1 and nums2.
• The constraints allow for a straightforward nested loop approach due to small input sizes.

Space and Time Complexity

Time Complexity: O(n * m)
Space Complexity: O(1)

Solution

To solve the problem, we can use a nested loop to iterate through each element of nums1 and nums2. For each combination of elements, we check if nums1[i] is divisible by nums2[j] * k. If it is, we count it as a good pair. We maintain a counter to keep track of the total number of good pairs found.

Code Solutions