Skip to content

Latest commit

 

History

History

Shortest Un-ordered SubArray

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 

An array is given of n length, and problem is that we have to find the length of shortest unordered {neither increasing nor decreasing} sub array in given array.

Input : n = 5
        7 9 10 8 11
Output : 3
Explanation : 9 10 8 unordered sub array.

Input : n = 5
       1 2 3 4 5
Output : 0 
Explanation :  Array is in increasing order.