1878. Check if Array Is Sorted and Rotated
My accepted Python solution to LeetCode problem 1878, Check if Array Is Sorted and Rotated, running in 0ms.
- Difficulty: Easy
- Python
- Runtime 0ms
- Memory 17.5MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 0ms, memory 17.5MB, accepted 2025-12-31.
class Solution:
def check(self, nums: List[int]) -> bool:
n = len(nums)
count = 0
for i in range(n):
if nums[i] > nums[(i + 1) % n]:
count += 1
return count <= 1