How should I practice Count Product-Divisible Pairs?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Motive phone screen problems in FastPrep.

Is Count Product-Divisible Pairs associated with Motive?

FastPrep tags this as a Motive phone screen coding practice problem when the problem catalog has that company and stage context.

Motive● MediumFULLTIMEPHONE SCREEN

Given an integer array nums and a positive integer k, return the number of index pairs i < j such that nums[i] * nums[j] is divisible by k.

countProductDivisiblePairs(nums: int[], k: int) → long

nums = [1,2,3,4,5]k = 2return = 7

nums = [1,2,3,4]k = 5return = 0