Given an integer array nums, determine whether nums can be obtained by taking some array that is sorted in nondecreasing order and rotating it by some number of positions. Return true if such a rotation is possible, otherwise return false.

A rotation by x positions means shifting the array so that the last x elements move to the front, while preserving their relative order.

Note: A rotation by $0$ positions is allowed.

Constraints:

• $1 \leq$ nums.length $\leq 100$

• $1 \leq$ nums[i] $\leq 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.