Timer is Running

Given two arrays **A** and **B** of size **N** and **M** respectively. The task is to find union between these two arrays.

Union of the two arrays can be defined as the set containing distinct elements from both the arrays. If there are repetitions, then only one occurrence of element should be printed in union.

**Input:**

The first line of input contains an integer **T** denoting the number of test cases. Then T test cases follow. Each test case consist of three lines. The first line of each test case contains two space separated integers *N* and *M*, where *N* is the size of array *A* and *M* is the size of array *B*. The second line of each test case contains *N *space separated integers denoting elements of array *A*. The third line of each test case contains *M* space separated integers denoting elements of array *B*.

**Output:**

Correspoding to each test case, print the count of union elements of the two arrays.

**Expected Time Complexity: **O(N + M).

**Expected Auxiliary Space: **O(N + M).

**Constraints:**

1 ≤ T ≤ 100

1 ≤ N, M ≤ 10^{5}

1 ≤ A[i], B[i] < 10^{5}

**Example:**

**Input:**

2

5 3

1 2 3 4 5

1 2 3

6 2

85 25 1 32 54 6

85 2

**Output:**

5

7

**Explanation:
Testcase 1: **1, 2, 3, 4 and 5 are the elements which comes in the union set of both arrays.

Author: rajatjha

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

lone_walker | 398 |

2isprime | 337 |

Umakant_Dubey | 314 |

rathindran | 262 |

saiujwal13083 | 251 |

saiujwal13083 | 889 |

ppsvikhyat17 | 712 |

lone_walker | 684 |

generic_coder | 630 |

NaveenGarg2 | 554 |

blackshadows | 5448 |

Ibrahim Nash | 5438 |

akhayrutdinov | 5111 |

mb1973 | 4976 |

Quandray | 4752 |

Login to report an issue on this page.