Easy C++ solution || Beginner Friendly
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int minimumRightShifts(vector<int>& arr) {\n        int n = arr.size();\n        vector<int> sorted(arr);\n        sort(sorted.begin(), sorted.end());\n\n        for (int i = 0; i < n; i++) {\n            if (arr == sorted) {\n                return i;\n            }\n            int last = arr[n - 1];\n            for (int j = n - 1; j > 0; j--) {\n                arr[j] = arr[(j - 1 + n) % n];\n            }\n            arr[0] = last;\n        }\n\n        return -1;\n    }\n};\n\n```
['C++']