title: (Algorithm) Find if two unsorted arrays have any common elements in O(n) time without sorting?
body: <p>We have two unsorted arrays and each array has a length of n. These arrays contain random integers in the range of 0-n<sup>100</sup>. How to find if these two arrays have any common elements in O(n)/linear time? Sorting is not allowed.</p>