Easy to understand and Beginner friendly solution in C++
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>& nums) {\n        vector<int> ans = nums;\n        sort(ans.begin(),ans.end());\n        for(int i=0; i<nums.size(); i++){\n        if(nums==ans)\n        return i;\n        int last = nums.back();\n        nums.pop_back();\n        nums.insert(nums.begin(),last);\n        }\n        return -1;\n    }\n    \n};\n```
['C++']