LeetCode Solution: 1752. Check if Array Is Sorted and Rotated

Mastering Rotated Arrays: A Beginner-Friendly Look at LeetCode 1752 Hey fellow coders! 👋 Today, we're diving into a super common and insightful LeetCode problem that's perfect for strengthening your array manipulation skills: 1752. Check if Array Is Sorted and Rotated. It sounds a bit tricky, but with a simple trick, we can unmask the mystery of these rotated arrays! Let's conquer it together. 🚀 Problem Explanation Imagine you have a perfectly sorted array of numbers in non-decreasing order (meaning numbers either go up or stay the same). For example: [1, 2, 3, 4, 5]. Now, imagine we take this array and "rotate" it. This means we move some elements from the beginning to the end, maintaining their relative order. For instance, if we rotate [1, 2, 3, 4, 5] by 2 positions, 1 and 2 move to the end: [3, 4, 5, 1, 2] The problem asks us to determine: Given an array nums, can it be formed by taking some originally sorted, non-decreasing array and rotating it? Important notes: Non-decreasing: