Problem: Given an distinct array, find two increasing subarrays(say `a`

and `b`

) such that when joined they produce one increasing array(say `ab`

). We need to find max possible length of array `ab`

.

The subarray should be contiguous.

The two subarray should not overlap

For example: given `array = [7 2 5 8 6 3 9 10]`

Two sub arrays are `a = [2 5 8]`

, `b = [9, 10]`

and `ab = [2 5 8 9 10]`

Output: `length(ab) = 5`

3 is not included in b because it is overlapping the subarray ‘a’.