Problem title
Difficulty
Avg time to solve

Find All Sub-Square Of Size K
Moderate
15 mins
Void of Diamond
Easy
--
Binary Pattern
Easy
10 mins
Longest Bracket
Moderate
20 mins
Minimum Operations To Make Strings Same
Moderate
25 mins
Print Matrix
Easy
15 mins
Rearrange Odd and Even Places
Moderate
25 mins
Deepest Left
Moderate
15 mins
Max Increasing Path
Moderate
15 mins
Odd Before Even
Moderate
25 mins
3

Minimum days to complete work

Difficulty: EASY
Contributed By
Avg. time to solve
15 min
Success Rate
90%

Problem Statement

We have to complete a total of ‘N’ works. Now, each work can be done on only one of the two special days given in 2 different arrays ‘day1’ and ‘day2’ respectively.

day1[i] denotes that the ‘i-th’ work can on the day1[i] th day and day2[i] denotes that the ‘i-th’ work can on the day2[i] th day. Also, it is guaranteed that day2[i] < day1[i].

Also, make sure, the works are being done in such a way that they must be in non-decreasing order in terms of days given in array ‘day1’.

Your task is to find the minimum number of days in which all the work can be completed.

For example
day1 = {5, 6, 2}
day2 = {2, 4, 1}

In this case, the ideal order will be to perform work 3 on the first day, work 1 on the second day and work 2 on the fourth day. The order with respect to Day1 in which the work is done will be {2, 5, 6} which is non-decreasing. Hence the number of days needed to finish all work will be 4.
Input format :
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 a single integer ‘N’ denoting the number of works to be done.

The second line contains ‘N’ space-separated integers denoting the sequence day1.

The last line contains ‘N’ space-separated integers denoting the sequence day2.
Output format :
For each test case, return the minimum number of days required to complete the work.
Note:
You do not need to print anything; it has already been taken care of. Just implement the given functions.
Constraints:
1 <= T <= 50
0 <= N <= 10^3
1<= day1[i],day2[i] <= 10^9

Time Limit: 1 sec
Sample Input 1 :
2
3
9 4 6
2 1 2
4
6 3 8 7
2 1 5 4
Sample Output 1 :
2
5
Explanation For Sample Input 1:
For the first test case:

We need two days for the above example.

If we do the first and third works first and then the second work then the order in which work is done according to Day1 will be: 6,9,4 which we can clearly see we will violate the conditions. As the order according to Day 1 is not non-decreasing because 9 comes after 4 which is violating the non-decreasing order condition.

However, On the first day, we do the second work and on the third day, we do the first and last works.
Hence we need two days to complete the work.



For the second test case:

We need two days for the above example.

We do the second work on the first day then the first work on the second day then the fourth work on the fourth day then the third work on the fifth day. The order in which work is done according to day1 will be 3,6,8,7 which is non decreasing which satisfies the conditions.
Sample Input 2 :
1
6
3 3 4 5 6 6
1 2 1 2 1 2
Sample Output 2 :
6
Reset Code
Full screen
copy-code
Console