Leetcode Problem 2855. Minimum Right Shifts to Sort the Array

2855. Minimum Right Shifts to Sort the Array

Leetcode Solutions

Find Minimum Index and Validate Sorted Order

  1. Initialize min_index to 0.
  2. Iterate through the array to find the index of the minimum element and update min_index.
  3. Check if the array is already sorted by comparing each element with its next element. If sorted, return 0.
  4. Starting from min_index + 1, check if the elements are in ascending order until the end of the array.
  5. Starting from the beginning of the array, check if the elements are in ascending order up to min_index.
  6. If any of the above checks fail, return -1.
  7. If all checks pass, return the number of right shifts required, which is nums.size() - min_index.
UML Thumbnail

Brute Force by Simulating Shifts

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...