Interviewed E3 (new grad). Make sure to study top META Tagged LC questions. Made it to the follow-up round, but got one-shotted by a LeetCode Hard problem. The interviewer didn't really seem to realize I was a new grad; they generally go easier for n
1. Calculate the square root of a double. 2. Given n intervals [si, fi], find the maximum number of overlapping intervals. 3. Print all the paths from the root to every leaf in a binary tree. 4. Print the sum of all numbers at every vertical level
I first had a phone interview with an engineer. It lasted about 40 minutes and was a coding exercise. After that, I proceeded to onsite interviews at the Menlo Park campus. In total, there were three interviews: * The first two were technical in
Interviewed E3 (new grad). Make sure to study top META Tagged LC questions. Made it to the follow-up round, but got one-shotted by a LeetCode Hard problem. The interviewer didn't really seem to realize I was a new grad; they generally go easier for n
1. Calculate the square root of a double. 2. Given n intervals [si, fi], find the maximum number of overlapping intervals. 3. Print all the paths from the root to every leaf in a binary tree. 4. Print the sum of all numbers at every vertical level
I first had a phone interview with an engineer. It lasted about 40 minutes and was a coding exercise. After that, I proceeded to onsite interviews at the Menlo Park campus. In total, there were three interviews: * The first two were technical in