K-diff Pairs in an Array

Problem statement Given an array of integer 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 is true: 0 <= i, j < nums.length i != j |nums[i] - n...