Member Technical Staff, Software Interview Questions | Glassdoor

Member Technical Staff, Software Interview Questions


Member technical staff, software interview questions shared by candidates

Top Interview Questions

Sort: Relevance Popular Date

How many race heats are needed to find the 3 fastest pinewood derby cars out of a field of 8, if only 4 cars can run at a time (assuming that every car will always run the way/speed and each lane is exactly equivalent)?

7 Answers

Each heat rules out 1 car (that cannot be one of the 3 fastest).

so is the answer 4 heat 1 (first 4 car) + 1 (4 second set) + 1( Top 2 from first + Top 2 from second set) + 1 (3 car heat among the 3rd placed car)

Only two races of four cars in each. Get the times of all cars and sort them. You don't need any more races because the times will be the same in subsequent races. :)

Given a series of strings, find the biggest common prefix.

4 Answers

1) How does an ISR work (All the way from the beginning to the end) 2) Data structures and approaches such as when to use a hash table, tree, list, etc. on a conceptual level

1 Answer

What do you know about concurrency? Describe in minute detail

1 Answer

How will you develop a ReadWriteConcurrentLock?

1 Answer

What do you know about websockets, long polling, short polling etc.?

1 Answer

find the sum of 3 integers in an array that is closest to the target value.

1 Answer

Nothing unexpected, just a question about cloning a linked list with an arbitrary pointer and to find an element in a matrix with elements sorted along the columns and rows.

1) Create binary tree from pre order and in order traversals 2) A question regarding dependency management (It was big use case description) which could be solved by two stacks 3) Graph traversal 4) Linked List node reversal of alternative node 1->2->3->4->5->6 would become 2->1->4->3->6->5

2 questions straight out of Cracking the coding interview (2 dimensional array and stack) Design a hash map. Difference between mutex and semaphore. Explain memory management and scheduling using a small program as example (in depth OS fundamentals). Threads, process, stacks, heaps - what is the relationship among them. 1 hour of questions only on pointers (eg. structure pointers, function pointers, incrementing and decrementing pointers) Using dynamic memory allocation flatten a 2 dimensional array into a single dimensional array. Row wise and column wise. (Again pointer increment and decrement) Questions on checkpointing and disaster recovery. Difference between a spin lock and a mutex. Serialize a binary tree.

110 of 53 Interview Questions