Jun 12

Author: siddydutta

2025-06-June-LeetCoding-Challenge/Maximum Difference Between Adjacent Elements in a Circular Array.py

@@ -0,0 +1,15 @@
+class Solution:
+    def maxAdjacentDistance(self, nums: list[int]) -> int:
+        return max(abs(n1 - n2) for n1, n2 in zip(nums, nums[1:] + nums[:1]))
+
+
+def main():
+    nums = [1, 2, 4]
+    assert Solution().maxAdjacentDistance(nums) == 3
+
+    nums = [-5, -10, -5]
+    assert Solution().maxAdjacentDistance(nums) == 5
+
+
+if __name__ == '__main__':
+    main()

2025-06-June-LeetCoding-Challenge/README.md

@@ -15,7 +15,7 @@
 | June 09 | [440. K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/) | Hard | Unsolved |
 | June 10 | [3442. Maximum Difference Between Even and Odd Frequency I](https://leetcode.com/problems/maximum-difference-between-even-and-odd-frequency-i/) | Easy | Solved |
 | June 11 | [3445. Maximum Difference Between Even and Odd Frequency II](https://leetcode.com/problems/maximum-difference-between-even-and-odd-frequency-ii/) | Hard | Unsolved |
-| June 12 | []() |  |  |
+| June 12 | [3423. Maximum Difference Between Adjacent Elements in a Circular Array](https://leetcode.com/problems/maximum-difference-between-adjacent-elements-in-a-circular-array/) | Easy | Solved |
 | June 13 | []() |  |  |
 | June 14 | []() |  |  |
 | June 15 | []() |  |  |
@@ -39,6 +39,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 1 | 1 | 0 |
+| Easy   | 2 | 2 | 0 |
 | Medium | 6 | 3 | 3 |
 | Hard   | 4 | 2 | 2 |