title: Find 3 numbers in 3 sorted arrays with sum equal to some value
body: <blockquote>
    <p><strong>Possible Duplicate:</strong><br>
    <a href="https://stackoverflow.com/questions/3987264/interview-question-three-arrays-and-onn">Interview question: three arrays and O(N*N)</a>  </p>
  </blockquote>
  
  
  
  <p>We have 3 sorted arrays A, B and C. <br />
  We have to find 3 numbers from each A, B and C such that a+b+c = x</p>
  
  <p>One way to do that will be to pick element from A and B and use binary search to find corresponding element in C. Complexity == O(n^2 lgn)</p>
  
  <p>Is there any other way to do this with preferably no extra space and complexity O(n^2) ? </p>
  
  <p>I was thinking of keeping a pointer at A ...now our question reduces to finding elements from B and C such that their sum is (x-a) but got little lost in this approach .</p>