Given two strings s and goal, determine whether goal can be obtained by rotating s. A rotation moves some number of characters from the beginning of s to the end while keeping their order.

Return true if goal is a rotation of s, otherwise return false.

Constraints:

• $1 \leq$ s.length, goal.length $\leq 100$

• s and goal consist of lowercase English letters.

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.