Member Technical Staff Interview Questions | Glassdoor

# Member Technical Staff Interview Questions

490

Member technical staff interview questions shared by candidates

## Top Interview Questions

Sort: RelevancePopular 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 AnswersEach 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 Responses4 if we cant measure time3 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 Responsesx = ["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"

### Senior Member of Technical Staff at VMware was asked...

Aug 1, 2012
 How do you reverse print a string. After answering the same by providing an out of the box API, the next unexpected question was "What if it does NOT exist". While and 2nd alternative was provided, it was pretty much shot down as being not acceptable.3 AnswersUse String tokenizer, dump to array and print the array in reverse. However, the prompt response to that answer was "What if there is NO stringtokenizer?" Stringtokenizer is an Out Of The Box API in java.util.maybe try something like this StringBuilder sb = new StringBuilder(str); sb.reverse();string.split('').reverse().join('');

### Member of Technical Staff IV at Juniper Networks was asked...

Jul 6, 2009
 Given a binary tree, how would you write program for getting mirror image of tree in O(n) time? Is it possible ? Assume you have no constraints on space.2 Answersif t is nul return; Mirror(Right) Mirror(Left) changeNodes(t)//call mirror( root, img_root) //img_node is passed by reference mirror (node, img_node ): if (node == NULL) return img_node.left = node.right img_node.right = mode.left mirror (node.right, img_node.left) mirror (node.left, img_node.right)

Apr 11, 2014

### Lead Member of Technical Staff - Test at Salesforce was asked...

Mar 2, 2015
 Lot of questions were around my previous experience2 AnswersIMO I would consider my answers very apt and more than in sync with the expectations they had for the role. And in some ways thats what irked me to write this review here as I don't believe rejecting me was on technical grounds..Sounds like you had a bad experience, but these things can happen for all sorts of reasons. Of the top of my head, perhaps: - the guy he talked to after you came across better - the rest of the team didn't like your resume - the requirements for the position changed Salesforce should have handled it better though

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

Aug 16, 2013
 4) Determine if a linked list is cyclic1 Answerstart = node; HashMap nodes = new HashMap(); while(true){ if(start == null){ System.out.println("the linked list is not circular"); break; } if(!nodes.containsKey(start.toString())) nodes.put(start.toString(),1); else{ System.out.println("the linked list is circular"); break; } start = start.next; }

### Member of Technical Staff at The Aerospace Corporation was asked...

Oct 19, 2015
 Derive the rocket equation.1 AnswerI derived it for them!

### Member of Technical Staff at ViaSat was asked...

Mar 5, 2012
 Write a linked list class. Make sure it has a method where we can insert a method at a specific index.1 AnswerSimple Linked List implementation in java

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

Mar 11, 2009
 Various questions on virtualisation1 AnswerMake sure you understand virtualisation before you come, and read the relevant systems papers. Make sure you know the difference between para and full virtualisation and the ways various competing approaches work.
110 of 490 Interview Questions