Given an array of N distinct integers, find a subarray $[$L$,$ R$]$ such that:

$1.$ All numbers in the subarray are between the two endpoints, i$.$e$.,$ the subarray contains all integers

i where L $<=$ i $<=$ R$.$

$2.$ The subarray contains the maximum number of integers that satisfy this condition.

$1$

Formally, for any index i in the subarray, the condition min$($subarray$)<=$ nums$[$i$]<=$ max$($subarray$)$

holds true, where min$($subarray$)$ and max$($subarray$)$ refer to the minimum and maximum values of the

subarray, respectively.