🐎 Day 3

Author: AkashRajpurohit

README.md

@@ -8,6 +8,7 @@
 
 1. [Number of Recent Calls](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3480/) ➡️ [CPP Solution](Week1/RecentCounter.cpp)
 2. [Combination Sum](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3481/) ➡️ [CPP Solution](Week1/combinationSum.cpp)
+3. [K-diff Pairs in an Array](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3482/) ➡️ [CPP Solution](Week1/findPairs.cpp)
 
 ## Week 2 🚧
 

Week1/findPairs.cpp

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    int findPairs(vector<int>& nums, int k) {
+        unordered_map<int, int> m;
+        int n = nums.size();
+        int count = 0;
+        
+        if(n <= 1) return count;
+        
+        for(int num: nums)
+            m[num]++;
+        
+        for(auto &x: m) {
+            if((k == 0 && x.second > 1) || (k > 0 && m.find(x.first - k) != m.end())) count++;
+        }
+        
+        return count;
+    }
+};