Leetcode Problem 3423 | Max Difference between adjacent elements in circular array |Hindi|Java|C++

You're given a circular array, where the first and last elements are also neighbors 🤯. Your mission?
👉 Find the largest jump between any two adjacent numbers!

Sounds easy? There's a twist — it's circular, so wrap-around counts too! 🌀

🧪 Test Case 1:
Input: [1, 2, 4]
Max Jump ➤ |4 - 1| = 3 (yes, the end meets the start!)

🧪 Test Case 2:
Input: [-5, -10, -5]
Max Jump ➤ |(-10) - (-5)| = 5

📏 Rules of the Game:

Array size: between 2 and 100

Each number: from -100 to 100

Only one pass needed for the win 🏆

🧠 Can YOU crack it in O(n)?

🎯 Stay tuned for the logic + code in the end!

#arraychallenge #codingpuzzle #dsa #codingfun #leetcode #shorts #interviewprep