solves k diff pair inan array

Author: anishLearnsToCode

README.md

@@ -140,7 +140,7 @@
 | 520 | [Detect Capital](https://leetcode.com/problems/detect-capital) | Easy | [![Java](assets/java.png)](src/DetectCapital.java) [![Python](assets/python.png)](python/detect_capital.py) |
 | 521 | [Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i) | Easy | [![Java](assets/java.png)](src/LongestUncommonSubsequenceI.java) [![Python](assets/python.png)](python/longest_uncommon_subsequence_I.py) |
 | 530 | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | Easy | [![Java](assets/java.png)](src/MinimumAbsoluteDifferenceInBST.java) [![Python](assets/python.png)](python/minimum_absolute_difference_in_bst.py) |
-| 532 | [K - Diff Pairs in Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | Easy | |
+| 532 | [K - Diff Pairs in Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | Easy | [![Java](assets/java.png)](src/KDiffPairsInAnArray.java) [![Python](assets/python.png)](python/k_dif_pairs_in_an_array.py) |
 | 538 | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree) | Easy | |
 | 541 | [Reverse String II](https://leetcode.com/problems/reverse-string-ii) | Easy | |
 | 543 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree) | Easy | |

python/k_dif_pairs_in_an_array.py

@@ -0,0 +1,20 @@
+from typing import List
+
+
+class Solution:
+    def findPairs(self, nums: List[int], k: int) -> int:
+        pairs = 0
+        if k == 0:
+            frequencies = {}
+            for number in nums:
+                frequencies[number] = frequencies.get(number, 0) + 1
+            for frequency in frequencies.values():
+                pairs += 1 if frequency > 1 else 0
+        else:
+            numbers = set()
+            for number in nums:
+                if number not in numbers:
+                    pairs += 1 if (number - k) in numbers else 0
+                    pairs += 1 if (number + k) in numbers else 0
+                    numbers.add(number)
+        return pairs

src/KDiffPairsInAnArray.java

@@ -0,0 +1,29 @@
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.Map;
+import java.util.Set;
+
+public class KDiffPairsInAnArray {
+    public int findPairs(int[] nums, int k) {
+        int pairs= 0;
+        if (k == 0) {
+            Map<Integer, Integer> frequencies = new HashMap<>();
+            for (int number : nums) {
+                frequencies.put(number, frequencies.getOrDefault(number, 0) + 1);
+            }
+            for (int frequency : frequencies.values()) {
+                pairs += frequency > 1 ? 1 : 0;
+            }
+        } else {
+            Set<Integer> numbers = new HashSet<>();
+            for (int number : nums) {
+                if (!numbers.contains(number)) {
+                    pairs += numbers.contains(number - k) ? 1 : 0;
+                    pairs += numbers.contains(number + k) ? 1 : 0;
+                    numbers.add(number);
+                }
+            }
+        }
+        return pairs;
+    }
+}