2025-06-12 Daily Challenge

Posted on:
Posted modified:
In: DailyChallenge

Today I have done leetcode's June LeetCoding Challenge with cpp.

June LeetCoding Challenge 12

Description

Maximum Difference Between Adjacent Elements in a Circular Array

Given a circular array nums, find the maximum absolute difference between adjacent elements.

Note: In a circular array, the first and last elements are adjacent.

 

Example 1:

Input: nums = [1,2,4]

Output: 3

Explanation:

Because nums is circular, nums[0] and nums[2] are adjacent. They have the maximum absolute difference of |4 - 1| = 3.

Example 2:

Input: nums = [-5,-10,-5]

Output: 5

Explanation:

The adjacent elements nums[0] and nums[1] have the maximum absolute difference of |-5 - (-10)| = 5.

 

Constraints:

  • 2 <= nums.length <= 100
  • -100 <= nums[i] <= 100

Solution

class Solution {
public:
  int maxAdjacentDistance(vector<int>& nums) {
    int len = nums.size();
    int answer = 0;
    for(int i = 0; i < len; ++i) {
      answer = max(answer, abs(nums[i] - nums[(i + 1) % len]));
    }
    return answer;
  }
};

// Accepted
// 962/962 cases passed (0 ms)
// Your runtime beats 100 % of cpp submissions
// Your memory usage beats 62.42 % of cpp submissions (30.4 MB)
Algorithm