Time: 47 ms (71.92%), Space: 104.9 MB (94.04%) - LeetHub

Shrutigupta03 · Shrutigupta03 · commit a76a44d782b2 · 2024-12-12T02:06:15.000+05:30
diff --git a/2779-maximum-beauty-of-an-array-after-applying-operation/2779-maximum-beauty-of-an-array-after-applying-operation.cpp b/2779-maximum-beauty-of-an-array-after-applying-operation/2779-maximum-beauty-of-an-array-after-applying-operation.cpp
@@ -0,0 +1,18 @@
+class Solution {
+public:
+    int maximumBeauty(vector<int>& nums, int k) {
+        sort(nums.begin(), nums.end());
+        int i=0,j=1;
+        int res = 1;
+        k*=2;
+        while(j<nums.size()){
+            if(nums[j]-nums[i]<=k){
+                if((j-i+1)>res) res = j-i+1;
+                j++;
+            }
+            else i++;
+        }
+        
+        return res;
+    }
+};
