Create Minimum Right Shifts to Sort the Array.java

varunu28 · web-flow · commit 80259e4d2dae · 2023-09-16T16:23:50.000-07:00
diff --git a/Easy/Minimum Right Shifts to Sort the Array.java b/Easy/Minimum Right Shifts to Sort the Array.java
@@ -0,0 +1,19 @@
+class Solution {
+    public int minimumRightShifts(List<Integer> nums) {
+        int mismatchIdx = -1;
+        int count = 0;
+        for (int i = 1; i < nums.size(); i++) {
+            if (nums.get(i - 1) > nums.get(i)) {
+                mismatchIdx = i;
+                count++;
+            }
+        }
+        if (count > 1) {
+            return -1;
+        }
+        if (count == 0) {
+            return 0;
+        }
+        return nums.get(nums.size() - 1) > nums.get(0) ? -1 : nums.size() - mismatchIdx;
+    }
+}
