Available question text
Count how many index pairs (i, j) satisfy nums1[i] being divisible by nums2[j] * k. With arrays up to 1e5 and values up to 1e6, the challenge is to efficiently count multiplicative/divisibility relationships (e.g., via frequency counts and iterating multiples/divisors) rather than using brute-force O(n*m).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3164. Find the Number of Good Pairs II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source