 GeeksforGeeks App
Open App Browser
Continue

# C++ Program for Minimum move to end operations to make all strings equal

Given n strings that are permutations of each other. We need to make all strings same with an operation that takes front character of any string and moves it to the end.
Examples:

```Input : n = 2
arr[] = {"molzv", "lzvmo"}
Output : 2
Explanation: In first string, we remove
first element("m") from first string and
append it end. Then we move second character
of first string and move it to end. So after
2 operations, both strings become same.

Input : n = 3
arr[] = {"kc", "kc", "kc"}
Output : 0
Explanation: already all strings are equal.```

The move to end operation is basically left rotation. We use the approach discussed in check if strings are rotations of each other or not to count number of move to front operations required to make two strings same. We one by one consider every string as the target string. We count rotations required to make all other strings same as current target and finally return minimum of all counts.
Below is the implementation of above approach.

## C++

 `// CPP program to make all strings same using``// move to end operations.``#include ``using` `namespace` `std;` `// Returns minimum number of moves to end``// operations to make all strings same.``int` `minimunMoves(string arr[], ``int` `n)``{``    ``int` `ans = INT_MAX;``    ``for` `(``int` `i = 0; i < n; i++)``    ``{``        ``int` `curr_count = 0; ` `        ``// Consider s[i] as target string and``        ``// count rotations required to make``        ``// all other strings same as str[i].``        ``for` `(``int` `j = 0; j < n; j++) {` `            ``string tmp = arr[j] + arr[j];` `            ``// find function returns the index where we``            ``// found arr[i] which is actually count of``            ``// move-to-front operations.``            ``int` `index = tmp.find(arr[i]);` `            ``// If any two strings are not rotations of``            ``// each other, we can't make them same. ``            ``if` `(index == string::npos)``                ``return` `-1;` `            ``curr_count += index;``        ``}` `        ``ans = min(curr_count, ans);``    ``}` `    ``return` `ans;``}` `// driver code for above function.``int` `main()``{``    ``string arr[] = {``"xzzwo"``, ``"zwoxz"``, ``"zzwox"``, ``"xzzwo"``}; ``    ``int` `n = ``sizeof``(arr)/``sizeof``(arr);``    ``cout << minimunMoves(arr, n);``    ``return` `0;``}`

Output:

`5`

Time Complexity: O(N3) (N2 due to two nested loops used and N is for the function find() used the inner for loop)

Space Complexity: O(1) since constant variables are used

Please refer complete article on Minimum move to end operations to make all strings equal for more details!

My Personal Notes arrow_drop_up