Dec 11

Author: siddydutta

2024-12-December-LeetCoding-Challenge/Maximum Beauty of an Array After Applying Operation.py

@@ -0,0 +1,25 @@
+from typing import List
+
+
+class Solution:
+    def maximumBeauty(self, nums: List[int], k: int) -> int:
+        nums.sort()
+        ptr1 = 0
+        for ptr2 in range(len(nums)):
+            if nums[ptr2]-nums[ptr1] > k*2:
+                ptr1 += 1
+        return ptr2-ptr1+1
+
+
+def main():
+    nums = [4, 6, 1, 2]
+    k = 2
+    assert Solution().maximumBeauty(nums, k) == 3
+
+    nums = [1, 1, 1, 1]
+    k = 10
+    assert Solution().maximumBeauty(nums, k) == 4
+
+
+if __name__ == '__main__':
+    main()

2024-12-December-LeetCoding-Challenge/README.md

@@ -13,7 +13,7 @@
 | December 8  | [2054. Two Best Non-Overlapping Events](https://leetcode.com/problems/two-best-non-overlapping-events/) | Medium | Solved |
 | December 9  | [3152. Special Array II](https://leetcode.com/problems/special-array-ii/) | Medium | Solved |
 | December 10 | [2981. Find Longest Special Substring That Occurs Thrice I](https://leetcode.com/problems/find-longest-special-substring-that-occurs-thrice-i/) | Medium | Unsolved |
-| December 11 | []() |  |  |
+| December 11 | [2779. Maximum Beauty of an Array After Applying Operation](https://leetcode.com/problems/maximum-beauty-of-an-array-after-applying-operation/) | Medium | Unsolved |
 | December 12 | []() |  |  |
 | December 13 | []() |  |  |
 | December 14 | []() |  |  |
@@ -39,5 +39,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 2 | 2 | 0 |
-| Medium | 8 | 6 | 2 |
+| Medium | 9 | 6 | 3 |
 | Hard   | 0 | 0 | 0 |