Member Technical Staff, Software Interview Questions | Glassdoor

# Member Technical Staff, Software Interview Questions

53

Member technical staff, software interview questions shared by candidates

## Top Interview Questions

Sort: Relevance Popular Date

### Member of Technical Staff Software Engineer at VMware was asked...

Jun 12, 2012
 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. :) Show More Responses 4 if we cant measure time 3 if we cannot measure time. Choose 4 cars at random for the first race. Trivially the slowest car in that race can be removed from consideration. For the second race randomly choose 3 previously untested cars as well as the third place car from race one. If the car from race one wins then all other cars in race 2 are slower than all of top three cars in race one and may be discarded. Similarly if the car from race one is in last place all of the cars from the first race may be removed from contention. In effect, regardless of how this car performs in the second race three additional cars may be removed from consideration. With one car removed in the first race and three additional cars removed in the second only 4 cars remain. The remaining four cars may be raced simultaneously in a third race to provide the final solution. 4 rounds choose 4 cars for the first round, and the other four from the second round; this makes up two round. The lowest cars in both round definitely cannot be part of the best 3. In the third heat, the last four cars from the first two rounds make up another round. At this point, its either all three in one round are the fastest, or the fastest two in one round and the best in the other. The winning 2 in this round are selected and a last round to determine the fastest three.

### Member of Technical Staff Software Engineer at VMware was asked...

Jan 12, 2012
 Given a series of strings, find the biggest common prefix. 4 Answers /** * Jun Zheng, Rice Univ * Given a series of strings, find the biggest common prefix. * Real question of VMware * Java7; running time: O(n^2) * @param str * @return */ private String biggestPrefix(String[] strs){ String prefix=strs[0]; for(int i=1;i0;i++){ int j; for(j=0;j0)? prefix:"No such prefix!"; } How that works? You are considering "prefix" must come from the very first string, which is not true. In the following string set, the biggest common prefix is "xyzasd" - which this program fails to find! String[] arr = {"MxyzasdNmm", "kxyzasdDodal", "I am a Good Boy", "JadxyznasdM Golmal", "ABCDEF", "ABCDEFGH", "Sunnyvale", "CaliforniaKxyzaszzMon"}; What? Prefix is not started from the very first string? Jesus I cannot read Eng! Show More Responses x = ["Ravite", "Raviteja", "Ravby", "Raviejaain","Ravi" ] #Given String y = x[0] for i in x: if len(i)> len(y): y = i fin = [] y = list(y) for i in range(len(y)): count = 0 for j in range(len(x)): if y[i]==x[j][i]: count +=1 if count == len(x): fin.append(y[i]) else: break if len(fin) > 0: print "".join(fin) else: print "No common prefix in series"

### Member of Technical Staff Software Engineer at Riverbed Technology was asked...

Oct 29, 2012
 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 If you paid attention in your CS classes, then you should do OK. They are _not_ just looking for code monkeys. I wound up doing better in my interviews than I thought I did.

### Member of Technical Staff I Software Engineer at eBay was asked...

Apr 12, 2015
 What do you know about concurrency? Describe in minute detail 1 Answer Described how registers, store buffers etc. work on a hardware level. Described how volatile keyword works.

Apr 12, 2015

### Member of Technical Staff I Software Engineer at eBay was asked...

Apr 12, 2015
 What do you know about websockets, long polling, short polling etc.? 1 Answer Described how connections etc. are kept open.

### Member of Technical Staff Software Engineer at VMware was asked...

Nov 18, 2016
 find the sum of 3 integers in an array that is closest to the target value. 1 Answer import itertools x = [32, 1, 2, 3, 4, 5, 6, 7, 8,10,11,23] #If this is the array or list y = 14 #If this is a target value z = list(itertools.combinations(x,3)) #print z diff = [] for i in z: diff.append(abs(sum(i)-y)) k = min(diff) print k for i in z: if abs(sum(i)-y) == k: print i

### Software Engineer (Member of Technical Staff) at Riverbed Technology was asked...

Jul 11, 2014
 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.

### Member of Technical Staff Software Engineer at Riverbed Technology was asked...

Mar 18, 2016
 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

### Member Technical Staff, Software at NetApp was asked...

Jan 8, 2016
 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