What is the best time complexity in which this can be done?

Revision en1, by rhezo, 2016-07-07 00:41:45

Given 2 sorted arrays with distinct elements, one sorted in increasing order and other sorted in decreasing order. Can we find the element which is present in both of them in O(logN) or O((logN)2)?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English rhezo 2016-07-07 00:41:45 263 Initial revision (published)