JuniorArray
Count Equal and Divisible Pairs in an Array
Given a 0-indexed integer array nums of length n and an integer k, return the number of pairs (i, j) where 0 <= i < j < n, such that nums[i] == nums[j] and (i * j) is divisible by k.
Example 1
Input
nums = [3,1,2,2,2,1,3], k = 2Output
4There are 4 pairs that meet all the requirements:
(0, 6), (2, 3), (2, 4), and (3, 4).Example 2
Input
nums = [1,2,3,4], k = 1Output
0Since no value in
nums is repeated, there are no pairs (i, j) that meet all the requirements.Constraints
- 1 <= nums.length <= 100
- 1 <= nums[i], k <= 100