Package g2101_2200.s2183_count_array_pairs_divisible_by_k

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2183 - Count Array Pairs Divisible by K.

    Hard

    Given a 0-indexed integer array nums of length n and an integer k, return the number of pairs (i, j) such that:

    • 0 <= i < j <= n - 1 and

    • nums[i] * nums[j] is divisible by k.

    Example 1:

    Input: nums = 1,2,3,4,5, k = 2

    Output: 7

    Explanation:

    The 7 pairs of indices whose corresponding products are divisible by 2 are

    (0, 1), (0, 3), (1, 2), (1, 3), (1, 4), (2, 3), and (3, 4).

    Their products are 2, 4, 6, 8, 10, 12, and 20 respectively.

    Other pairs such as (0, 2) and (2, 4) have products 3 and 15 respectively, which are not divisible by 2.

    Example 2:

    Input: nums = 1,2,3,4, k = 5

    Output: 0

    Explanation: There does not exist any pair of indices whose corresponding product is divisible by 5.

    Constraints:

    • <code>1 <= nums.length <= 10<sup>5</sup></code>

    • <code>1 <= numsi, k <= 10<sup>5</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Long countPairs(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait