I don't have the exact question link which directs us implement this idea but I have an abstract.

Two arrays containing distinct(unique) elements are given . We have to delete minimum number of elements from both the arrays such that a strictly increasing sequence of length 4 does not exist. Provided a Sequence is made by alternately taking elements from the arrays.

Arrays contain only the elements from [1,array1.length+array2.length]