Google

Interview with HR, then live coding interview with a developer. Basic question involving Linkedlist. Developing something involving an algorithm is done in pair programming. It wasn't that difficult; you just need to be trained in data structures.

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.

I applied online. The process took 4 weeks. Good interview that was hard, but it was not that bad. I think you should try your chances. It is a big company, and of course the questions are a bit hard.