Calculate the maximum length of the stricly increasing subarray without removing any element
let ans = 0 ; l = 1 ; for ( let i = 1 ; i < n ; i ++ ) { if ( a [ i ] > a [ i - 1 ] ) l ++ ; else l = 1 ; ans = Math . max ( ans , l ) ; }