Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3162. Find the Number of Good Pairs I
Count the number of pairs (i, j) such that nums1[i] is divisible by nums2[j] * k (i.e., nums1[i] % (nums2[j]*k) == 0). With n, m ≤ 50 you can brute-force all pairs or use a frequency map of nums2 values to tally matching divisibility checks.
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.