EASY BY PRINCE GANESHWALA
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int semiOrderedPermutation(int[] nums) {
        int length=nums.length;
        int minelementindex=-1;
        int maxelementindex=-1;
        for(int i=0;i<length;i++)
        {
            if(nums[i]==1)
            {
                minelementindex=i;
            }
            if(nums[i]==length)
            {
                maxelementindex=i;
            }
        }
        int ans=0;
        if(minelementindex<maxelementindex)
        {
            ans+=minelementindex;
            ans+=length-1-maxelementindex;
        }
       else if(maxelementindex<minelementindex)
       {
            ans+=length-1-maxelementindex;
            ans+=minelementindex-1;
       }
       
        return ans;
    }
}
```
['Java']