Rotation of envelope is not allowed, that is, height and width can’t be exchanged
The first line of input contains an integer ‘T’ denoting the number of test cases.
The next 3*T lines represent the ‘T’ test cases.
The first line of each test case contains an integer ‘N’, representing the number of envelopes.
The second line of the test case contains ‘N’ space-separated integers representing elements of the array ‘height’.
The third line of the test case contains ‘N’ space-separated integers representing elements of the array ‘width’.
For each test case, print, in a separate line, the maximum number of envelopes you can Russian doll.
You do not need to print anything, it has already been taken care of. Just implement the given function.
1 <= T <= 50
1 <= n <= 10^4
1 <= height[i] <= 10^9
1 <= width[i] <= 10^9
Time Limit: 2 sec
Search In A Sorted 2D Matrix
Ninja And The Strictly Increasing Array
Negative To The End
8-Queen Problem
Fake Coin Problem