Amazing.
Great company.
Impressed.
Cool.
Overreaching perhaps, if that's a con.
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.
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.
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.
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.