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
+