K-diff Pairs in an Array

[abhinav5481]

💥 Proposal

Given an array of integers nums and an integer k, return the number of unique k-diff pairs in the array. A k-diff pair is an integer pair (nums[i], nums[j]), where the following are true: 0 <= i, j < nums.length i != j |nums[i] - nums[j]| == k Notice that |val| denotes the absolute value of val.

Have you read the Contributing Guidelines on Pull Requests ?

yes

[abhinav5481]

Hi @ankitapuri I would like to work on it in python under crossWoc'21. Please assign it to me.

[pri1311]

I would like to do it in c++