From 47ddfc37e5f15fdd250d8dd63bd6b70220b0f5ef Mon Sep 17 00:00:00 2001
From: bumpsoo <bumpsoo063@protonmail.ch>
Date: Thu, 12 Jun 2025 12:20:16 +0000
Subject: [PATCH] 
 https://leetcode.com/problems/maximum-difference-between-adjacent-elements-in-a-circular-array

---
 ...e_between_adjacent_elements_in_a_circular_array.py | 11 +++++++++++
 1 file changed, 11 insertions(+)
 create mode 100644 easy/maximum_difference_between_adjacent_elements_in_a_circular_array.py

diff --git a/easy/maximum_difference_between_adjacent_elements_in_a_circular_array.py b/easy/maximum_difference_between_adjacent_elements_in_a_circular_array.py
new file mode 100644
index 0000000..f65f1b1
--- /dev/null
+++ b/easy/maximum_difference_between_adjacent_elements_in_a_circular_array.py
@@ -0,0 +1,11 @@
+# https://leetcode.com/problems/maximum-difference-between-adjacent-elements-in-a-circular-array
+
+from typing import List
+
+class Solution:
+    def maxAdjacentDistance(self, nums: List[int]) -> int:
+        result = 0
+        for i in range(len(nums)):
+            result = max(abs(nums[i] - nums[i - 1]), result)
+        return result
+