Sub Sort Problem Statement

You are given an integer array ARR. Determine the length of the shortest contiguous subarray which, when sorted in ascending order, results in the entire array being sorted in ascending order.

Definition:

An array C is considered a subarray of array D if it can be obtained from D by the deletion of several elements (possibly zero) from the beginning and end of array D.

Example:

Input:

ARR = [10, 12, 20, 30, 25, 40, 32, 31, 35, 50, 60]

Output:

6

Explanation:

The subarray [30, 25, 40, 32, 31, 35] needs to be sorted. When sorted, the entire array will be in ascending order. The length of this subarray is 6.

Input:

The very first line of input contains an integer ‘T’ denoting the number of test cases.
The first line of every test case contains one integer ‘N’ denoting the number of elements in the array.
The second line of every test case contains ‘N’ space-separated integers denoting the elements present in the array.

Output:

For each test case, print the shortest length of the unsorted subarray. Output each length on a separate line.

Constraints:

• 1 ≤ T ≤ 10
• 1 ≤ N ≤ 5 * 10^4
• -10^5 ≤ ARR[i] ≤ 10^5
• Time Limit: 1 sec

Note:

You do not need to print anything; it has already been taken care of. Just return the length of the shortest subarray.