Create count_pairs_of_points_with_distance_k.cpp

[greeshma739]

You are given a 2D integer array coordinates and an integer k, where 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 XOR operation.

Return the number of pairs (i, j) such that i < j and the distance between points i and j is equal to k.

Description of Change

Checklist

• [x] Added description of change
• [x] Added file name matches File name guidelines
• [x] Added tests and example, test must pass
• [x] Added documentation so that the program is self-explanatory and educational - Doxygen guidelines
• [x] Relevant documentation/comments is changed or added
• [x] PR title follows semantic commit guidelines
• [x] Search previous suggestions before making a new one, as yours may be a duplicate.
• [x] I acknowledge that all my contributions will be made under the project's license.

Notes: I want to add this important sum of bit manipulation

[github-actions[bot]]

This pull request has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions[bot]]

Please ping one of the maintainers once you commit the changes requested or make improvements on the code. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions!