Easy Brute Force Soln
\n\n# Code\n\nclass Solution {\n    public int minimumRightShifts(List<Integer> ls) {\n        int n=ls.size();\n        int count=0;\n        List<Integer> cop
\n\n# Code\n```\nclass Solution {\n    public int minimumRightShifts(List<Integer> ls) {\n        int n=ls.size();\n        int count=0;\n        List<Integer> copy=new ArrayList<>(ls);\n        Collections.sort(copy);\n        if(ls.equals(copy)){\n            return 0;\n        }\n        while(count<n){\n            int num=ls.remove(n-1);\n            ls.add(0,num);\n            int flag=1;\n            for(int i=0;i<n;i++){\n                if(ls.get(i)!=copy.get(i)){\n                    flag=0;\n                    break;\n                }\n            }\n            count++;\n            if(flag==1){\n                return count;\n            }\n        }\n        return -1;\n    }\n}\n```
['Java']