Google

There weren't so many interviews because this was not the first trial for the position. So it wasn't so difficult; it was very easy. There were no problems at all. What do you want to ask me?

Very good, but too many questions. I felt I was not ready. Next time, I'll prepare more. The questions were hard, but I managed anyway. It is a nice company; everyone should work here. They pay well. There are lots of benefits, and they are very nice

There are two sorted arrays, `nums1` and `nums2`, of size `m` and `n` respectively. Find the median of the two sorted arrays. The overall run-time complexity should be O(log(m+n)). You may assume `nums1` and `nums2` cannot both be empty.