Given two sorted arrays of distinct elements. There is only 1 difference between the arrays. First array has one element extra added in between. Find the index of the extra element.
The first line of input contains an integer T, denoting the no of test cases. Then T test cases follow. The first line of each test case contains an integer N, denoting the number of elements in array. The second line of each test case contains N space separated values of the array A. The Third line of each test case contains N-1 space separated values of the array B.
Return the index (0 based indexing) of the corresponding extra element in array A.(starting index 0).
You don't have to take any input. Just complete the provided function findExtra() that takes array A, B and size of A and return the valid index (0 based indexing).
Expected Time Complexity: O(log N).
Expected Auxiliary Space: O(1).
2 4 6 8 9 10 12
2 4 6 8 10 12
3 5 7 9 11 13
3 5 7 11 13
Testcase 1: In the second array, 9 is missing and it's index in the first array is 4.
Testcase 2: In the second array, 9 is missing and it's index in the first array is 3.
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.