Sync LeetCode submission Runtime - 4 ms (23.02%), Memory - 17.8 MB (48.85%)

Author: jimit105

3747-maximum-difference-between-adjacent-elements-in-a-circular-array/README.md

@@ -0,0 +1,36 @@
+<p>Given a <strong>circular</strong> array <code>nums</code>, find the <b>maximum</b> absolute difference between adjacent elements.</p>
+
+<p><strong>Note</strong>: In a circular array, the first and last elements are adjacent.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [1,2,4]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">3</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>Because <code>nums</code> is circular, <code>nums[0]</code> and <code>nums[2]</code> are adjacent. They have the maximum absolute difference of <code>|4 - 1| = 3</code>.</p>
+</div>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [-5,-10,-5]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">5</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>The adjacent elements <code>nums[0]</code> and <code>nums[1]</code> have the maximum absolute difference of <code>|-5 - (-10)| = 5</code>.</p>
+</div>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>2 &lt;= nums.length &lt;= 100</code></li>
+	<li><code>-100 &lt;= nums[i] &lt;= 100</code></li>
+</ul>

3747-maximum-difference-between-adjacent-elements-in-a-circular-array/solution.py

@@ -0,0 +1,14 @@
+# Approach 1: Traversal
+
+# Time: O(n)
+# Space: O(1)
+
+class Solution:
+    def maxAdjacentDistance(self, nums: List[int]) -> int:
+        n = len(nums)
+        res = abs(nums[0] - nums[n - 1])
+
+        for i in range(n - 1):
+            res = max(res, abs(nums[i] - nums[i + 1]))
+
+        return res