Hi!!!!! Solved LeetCode problem 1752 today (Check if the array is sorted and rotated). Key concepts I understood in this problem: Sorted + rotated → order breaks only once (track with count). Loop 0 -> n-1, compare nums[i] with nums[(i+1) % n]. If count > 1 ->False, else True