|All-time Popular Problems|
|Delete without head pointer|
|Rotate Array by n elements|
|Reverse array in groups|
|Implement Queue using Linked List|
|Column name from a given column number|
|Element with left side smaller and right side greater|
|Remove duplicate element from sorted Linked List|
|Triplet Sum in Array|
|Reverse an Array|
Given 2 sorted arrays A and B of size N each. Print sum of middle elements of the array obtained after merging the given arrays.
The first line contains 'T' denoting the number of testcases. Then follows description of testcases.
Each case begins with a single positive integer N denoting the size of array.
The second line contains the N space separated positive integers denoting the elements of array A.
The third line contains N space separated positive integers denoting the elements of array B.
For each testcase, print the sum of middle elements of two sorted arrays. The number of the elements in the merged array are even so there will be 2 numbers in the center n/2 and n/2 +1. You have to print their sum.
1 2 4 6 10
4 5 6 9 12