Time: 23 ms (100.00%), Space: 57.3 MB (42.09%) - LeetHub

py3-coder · py3-coder · commit 83a56b33919f · 2024-11-13T21:24:13.000+05:30
diff --git a/2563-count-the-number-of-fair-pairs/2563-count-the-number-of-fair-pairs.java b/2563-count-the-number-of-fair-pairs/2563-count-the-number-of-fair-pairs.java
@@ -0,0 +1,25 @@
+class Solution {
+    public long countFairPairs(int[] nums, int lower, int upper) {
+        Arrays.sort(nums);
+       
+        return findCountTarget(nums,upper+1)-findCountTarget(nums,lower);
+    }
+    
+    public long findCountTarget(int[] nums , int target){
+        long cnt=0;
+        int start = 0;
+        int end = nums.length-1;
+        
+        while(start<=end){
+            if(nums[start]+nums[end]<target){
+                cnt += end-start;
+                start++;
+            }else{
+               end--;
+            }
+        }
+        return cnt;
+    }
+    
+   
+}
