Table of Contents
We Are Discuss About LeetCode Solution
Count Pairs of Points With Distance k LeetCode Solution
Count Pairs of Points With Distance k
- User Accepted:1
- User Tried:8
- Total Accepted:1
- Total Submissions:9
You are given a 2D integer array
coordinates and an integer
coordinates[i] = [xi, yi] are the coordinates of the
ith point in a 2D plane.
We define the distance between two points
(x1, y1) and
(x2, y2) as
(x1 XOR x2) + (y1 XOR y2) where
XOR is the bitwise
Return the number of pairs
(i, j) such that
i < j and the distance between points
j is equal to
Input: coordinates = [[1,2],[4,2],[1,3],[5,2]], k = 5 Output: 2 Explanation: We can choose the following pairs: - (0,1): Because we have (1 XOR 4) + (2 XOR 2) = 5. - (2,3): Because we have (1 XOR 5) + (3 XOR 2) = 5.
Input: coordinates = [[1,3],[1,3],[1,3],[1,3],[1,3]], k = 0 Output: 10 Explanation: Any two chosen pairs will have a distance of 0. There are 10 ways to choose two pairs.
2 <= coordinates.length <= 50000
0 <= xi, yi <= 106
0 <= k <= 100
6 digit code appear after 69 seconds.