Working here, you feel very nice.
Kind of a hard job, ngl.
It's not too bad.
Standard phone screen. The interviewer was friendly. I was not challenged much. He just took notes quietly and said thank you at the end. I couldn't tell if he was happy with my answers.
Referred by a friend, I quickly got a phone interview one week after. First, I described my current work, projects, and experience on my resume. Then, I was asked about the difference between interface inheritance and implementation inheritance. Th
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.
Standard phone screen. The interviewer was friendly. I was not challenged much. He just took notes quietly and said thank you at the end. I couldn't tell if he was happy with my answers.
Referred by a friend, I quickly got a phone interview one week after. First, I described my current work, projects, and experience on my resume. Then, I was asked about the difference between interface inheritance and implementation inheritance. Th
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.