Consider the two arrays a and b. a: 1 2 3 4 5 b: 3 4 5 1 2 It is possible to transform array a into array b by right shifting each element of a to the right three places. If an element falls off the back of the array have it come around the front and keep counting positions. That is how 3 in array ended up in the first position of array b. One way to look at this is to imagine that we are moving the element around in a circular manner. In the example above, we have right shifted the array 3 positions to the right. Definition: Let a and b be two integer arrays of the same length. We say that they are shift equivalent if array a can be right shifted to create array b.

#include using namespace std; bool equivalent(int a[], int b[], int n); int main() { string string_a, string_b; cin >> string_a; cin >> string_b; int n = string_a.size(); int a[n], b[n]; for (int i = 0; i < n; i++) { a[i] = string_a[i]; b[i] = string_b[i]; } cout << equivalent(a,b,n); } bool equivalent(int a[], int b[], int n) { return true; }

Do not make any changes to the main method.

You can test your code by clicking run, then enter 2 strings. Since the arrays are converted from string, enter one line at a time, without any spaces. For example, the inputs "12345" followed by "34512" would represent the example in the original problem. You can also enter alphabets and symbols. Keep in mind that "12" would always be considered {12} instead of {1,2}.