Given a BST with å person on the root node of it, find the path in which the person would take maximum no. of turns. You take a turn when you are moving in right and you turn left or vice versa.
Member Technical Staff Interview Questions
10,978 member technical staff interview questions shared by candidates
There were many questions. I am mentioning some of the good questions here. Q1. Given a tree, and there will be treasure in one of the nodes. We can query any node, it will return the node itself if it contains the treasure or it returns the branch which leads to the treasure. we need to find out the treasure in minimum number of queries.
There were two questions in the coding assessment, related to algorithm and graph. In the first technical round, I was given two coding questions and was asked to code those, these questions were related to heap and BST. The interviewer also asked me some technical questions from operating systems and algorithms. In the second technical round, I was asked some networking questions, since I was interviewed for a team working in distributed systems and networking domain. I was then asked to code a something like DNS server. The follow up question was to implement aging to the server by adding caching.
Merge k list
The phone screens also test your fundamentals in systems computing. I had questions testing my knowledge and understanding of computer architecture and virtual memory Focus was around your previous experiences. They grilled me on my concepts of operating systems, file systems, memory management and synchronization primitives.
Vertical order traversal
Given an unsorted array of numbers and a target, find all the unique triplets whose sum is equal to target in constant space. Input: array = [1, 1, 2, 1, 3] target = 4 Output = [[1, 1, 2]]
In each of the technical rounds, they asked me 1-2 coding questions each. Some were LC style and others were based on my systems knowledge (eg. implement deep ls command, implement locking code). I was also asked a lot around my resume and questions around distributed systems.
Telephonic: Given a binary tree of numbers and a search number has given, find out first occurence of that number and smallest distance from root node. if you have given k search numbers find their occurence and nearest from root node in a single walk.
Find the minimum number of steps required to change a 4-digit prime number to another prime number (if possible), such that each intermediate number formed after each change is also a prime
Viewing 241 - 250 interview questions