Google

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.

It was a coding interview where they gave me a link to access two problems. One was easy, and the second was quite hard for an entry-level position. However, I understand it's a FAANG company, and the competition is high.

The process began with an initial technical test, which included two coding questions. This was followed by a phone screening. After that, I participated in a remote on-site interview, which consisted of four technical interviews and one behavioral