Shortest Subarray to be Removed to Make Array Sorted.java

class Solution {
    public int findLengthOfShortestSubarray(int[] arr) {
        int n=arr.length;
        int l=0;
        while(l<n-1 && arr[l]<=arr[l+1])
        {
            l++;
        }
        int r=n-1;
        while(r>0 && arr[r]>=arr[r-1])
        {
            r--;
        }
        if(l==n-1)
        {
            return 0;
        }
      
        int ans=Math.min(n-l-1,r);
         int i=0;
         int j=r;
         while(i<=l && j<n)
         {
            if(arr[i]<=arr[j])
            {
                ans=Math.min(ans,j-i-1);
                i++;
            }
            else
            {
                j++;
            }
         }
         return ans;



    }
}