More DBA job interview questions and answers at
http://dba.fyicenter.com/Interview-Questions/

*(Continued from previous question...)*

**
Google Technical Interviews in Management round: Given two sorted arrays A and B.
**

Given two sorted arrays A and B.

1. Find the intersection of these arrays A and B.

Solution:The intersection can be found by using a variation of merge routine of the merge sort.

2. If array A is small and array B is too large. how will you proceed for getting intersection of those two arrays?

Solution:In this case for each entry of smaller array,we can run a binary search routine on the larger one to know its presence.

*(Continued on next question...)*