LeetCode — Check if Array is sorted and rotated

Given an array nums, return true if the array was originally sorted in non-decreasing order, then rotated some number of positions (including zero). Otherwise, return false.

There may be duplicates in the original array.

Note: An array A rotated by x positions results in an array B of the same length such that A[i] == B[(i+x) % A.length], where % is the modulo operation.

Example 1:

Example 2:

Example 3:

Example 4:

Example 5:

Constraints:

  • 1 <= nums.length <= 100
  • 1 <= nums[i] <= 100

Solution:

Check if array is sorted and rotated — Array

Dell Technologies — VxRail Software Engineer 👨‍💻