Logical questions were asked. Corner case were seriously considered.
Member Technical Staff Interview Questions
4,283 member technical staff interview questions shared by candidates
There were mainly two questions, one was from graph+combinatorics and the other question required the knowledge of heap data structure
Design question
Design log parser using any language .
Usual CS style Qs.
Questions were not very difficult. They were all based on data structures and algorithms.
The first interview was based on resume and one LC medium problem( followup multithreaded solution of the problem) The second interview was based on OS concepts and one LC medium problem( followup multithreaded solution of the problem and time/space complexity) The third interview was based on resume asked about one of the projects and asked me to code it(small version of the project)
Coding problems covered basic data structures, greedy approach... For OS, be well versed with issues of concurrency, memory management...
DP question on coin change DFS and level order traversal
Round - 4 Q1 - This was taken by a senior person who first had a quick discussion with me on the current tools, platform, linux commands we use in my current job. How we debug memory corruption issue, various gdb commands, narrowing down the issue from big GBs of logs, putting diagnostics and around that. Q2 - Followed by that, I was asked a coding problem, where we have plants' health in the form of array. At some point, one of the plants gets infected and now it will spread the infection to its immediate left and right plant at every time stamp. If your current plant's heath is greater than infected plan, its health will be reduced by infected plant's health. After a certain point of time, the whole array will become stable when all the plants will die or are far enough to not infect each other. We had to compute how much time it will take to reach that stable state. We discussed the approach and coded the problem. For example given input - int plants[1,3,8,6,7,4] Let's say the plant with height 6 gets infected at T0. Then at T1 we will have something like [1,3,2,0,1,4]. plants[3] will die and the infection reduce the health of neighbours by 6. Now the infection will spread to plants[2] and plants[4] At T2, plants[2] and plants[4] will die and the array will look something like [1,1,0,0,0,3] i.e (3-2 and 4-1). Now plants[1] and plants[5] are infected. Now there are no more plants which are neighbours of infected plants whose health is greater than infected health, so we stop and return 2.
Viewing 3341 - 3350 interview questions