From fb8f58192b3f1230ffeb2e4c3fd04d09b42b5359 Mon Sep 17 00:00:00 2001
From: mukul <sharmamukul585@gmail.com>
Date: Mon, 19 Jan 2026 22:00:26 +0530
Subject: [PATCH] Done with competitive coding-3

---
 K-diff.java | 34 ++++++++++++++++++++++++++++++++++
 1 file changed, 34 insertions(+)
 create mode 100644 K-diff.java

diff --git a/K-diff.java b/K-diff.java
new file mode 100644
index 00000000..e0a542e1
--- /dev/null
+++ b/K-diff.java
@@ -0,0 +1,34 @@
+import java.util.Arrays;
+
+class Solution {
+    public int findPairs(int[] nums, int k) {
+        if (k < 0) return 0;
+        Arrays.sort(nums);
+        int n=nums.length;
+        int right=1;
+        int left=0;
+        int count=0;
+        //int arr= new int[n];
+
+        while(left<n && right<n){
+            if(left==right || nums[right]-nums[left]<k){
+                right++;
+            }
+
+            else if(nums[right]-nums[left]>k){
+                left++;
+            }
+            else{
+                count++;
+                left++;
+                right++;
+                // Skip duplicates
+                while (right < n && nums[right] == nums[right - 1]) right++;
+                while (left < right && nums[left] == nums[left - 1]) left++;
+            }
+        }
+        return count;
+    }
+}
+
+