Added solution for minimum right shifts to sort the array.

Saloni6111 · Oct 30, 2024 · 0a7064b · 0a7064b
1 parent a3fac8b
commit 0a7064b
Showing 1 changed file with 13 additions and 0 deletions.
diff --git a/C++/minimum-right-shifts-to-sort-the-array.cpp b/C++/minimum-right-shifts-to-sort-the-array.cpp
@@ -0,0 +1,13 @@
+class Solution {
+public:
+    int minimumRightShifts(vector<int>& nums) {
+        for (int i = 0; i < nums.size(); ++i) {
+            if (is_sorted(nums.begin(), nums.end()))
+                return i;
+            int last_element = nums.back();
+            nums.pop_back();
+            nums.insert(nums.begin(), last_element);
+        }
+        return -1;
+    }
+};