Implement longest increasing subarray with one deletion

Choose a non-empty contiguous segment of nums by picking two 0-based indices l and r with 0 <= l <= r < nums.length. You may remove at most one element from that segment, or remove none. The remaining elements, kept in their original relative order, must be strictly increasing: every remaining element must be smaller than the next remaining element. Return [best_length, [l, r]], where best_length is the maximum achievable number of remaining elements over all segment…