3818. Minimum Prefix Removal to Make Array Strictly Increasing

You are given an integer array nums.

You need to remove exactly one prefix (possibly empty) from nums.

Return an integer denoting the minimum length of the removed prefix such that the remaining array is strictly increasing.

class Solution {
public:
    int minimumPrefixLength(vector<int>& nums) {
        for(int i = nums.size() - 1; i; i--) {
            if(nums[i-1] >= nums[i]) return i;
        }
        return 0;
    }
};