Search
⌘K
Get Premium
Leetcode 2183. Count Array Pairs Divisible by K
Count the number of index pairs (i<j) whose product nums[i]*nums[j] is divisible by k. With n up to 1e5, this requires better than O(n^2); a typical solution groups numbers by gcd(nums[i], k) and counts pairs of gcd-values whose product is a multiple of k.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.