Add 532

Author: trung-hn

Readme.md

@@ -81,6 +81,7 @@
 | 520 | Detect Capital | Easy | O(N) | O(1) | | | |
 | 525 | Contiguous Array | Medium | O(N) | O(N) | Hash Table | Very good problem | |
 | 528 | Random Pick with Weight | Medium | O(N), O(logN) | O(N), O(1) | Binary Search, Random | Pythonic | |
+| 532 | K-diff Pairs in an Array | Medium | O(N) | O(N) | Array, Two Pointers | | |
 | 540 | Single Element in a Sorted Array | Medium | O(logN) | O(1) | Binary Search | | |
 | 567 | Permutation in String | Medium | O(S1 + S2) | O(1) | String, Two Pointers, Sliding Window | | |
 | 624 | Maximum Distance in Arrays | Easy | O(N) | O(1) | Hash Table, Array | | 🔒 |

inputs/532

@@ -0,0 +1,10 @@
+[3,1,4,1,5]
+2
+[1,2,3,4,5]
+1
+[1,3,1,5,4]
+0
+[1,2,4,4,3,3,0,9,2,3]
+3
+[-1,-2,-3]
+1

src/532.k-diff-pairs-in-an-array.py

@@ -0,0 +1,17 @@
+#
+# @lc app=leetcode id=532 lang=python3
+#
+# [532] K-diff Pairs in an Array
+#
+
+# @lc code=start
+# TAGS: Array, Two Pointers
+class Solution:
+	# 68 ms, 99.66%. Time and Space: O(N)
+    def findPairs(self, nums: List[int], k: int) -> int:
+        C = collections.Counter(nums)
+        if k == 0:
+            return sum(val > 1 for val in C.values())
+        return sum(num + k in C for num in C)
+# @lc code=end
+