Staff software engineer Interview Questions in San Jose, CA | Glassdoor

# Staff software engineer Interview Questions in San Jose, CA

113

staff software engineer 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)?8 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.There's a lot of elements to typically cover in these questions, clarifications, scoping, making sure you're answering the actual question the interviewer is looking for you to answer, etc. Could be worth doing a mock interview with one of the Prepfully VMware Member of Technical Staff Software Engineer experts... they've worked in the role so they clearly know how to get through the interview. prepfully.com/practice-interviews

### 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"

### Staff Software Engineer at VMware was asked...

Jun 8, 2017
 Given a tree, how would determine if it is a binary search tree ? 2 AnswersA simple swap pointers routine with each pointer using its own mutex, emphasis on use of multiple mutexes for locking and deadlock avoidance.Do a inorder traversal of the tree and expect a sorted o/p for BST.. if the order is not sorted, then the tree is not BST

### Staff Software Engineer at FTV was asked...

Nov 11, 2017
 What is your greatest strength?1 AnswerI have an extremely strong work ethic. When I'm working on a project, I don't want just to meet deadlines. Rather, I prefer to complete the project well ahead of schedule. Last year, I even earned a bonus for completing my three most recent reports one week ahead of time.

### Staff Software Engineer at MobileIron was asked...

Sep 13, 2018
 Arrays, dynamic programming, Java locks, synchronizations, etc.1 AnswerIt was easy (sorry cannot disclose the questions, but glassdoor questions helped me).

### Staff Software Engineer at Rambus was asked...

Jun 7, 2019
 7. A windowless room contains three identical light fixtures, each containing an identical light bulb or light globe. Each light is connected to one of three switches outside of the room. Each bulb is switched off at present. You are outside the room, and the door is closed. Before opening the door you may play around with the light switches as many times as you like. But once you've opened the door, you may no longer touch a switch. After this, you go into the room and examine the lights. How can you tell which switch goes to which light? 1 AnswerSwitch on any 2 switches and keep the on for few minutes. Then switch one of the switches off and quickly enter the room. Then touch the bulbs with your hands. The one that is lit will be connected to the switch that is left on. The one that is warm will be connected to the switch that was turned off. The cold one will be connected to the untouched switch.

### Staff Software Engineer at Infinera was asked...

Oct 2, 2018
 Data structures(tree delete node, circular buffer) RTOS priority ceiling problem. Interesting bugs solved. system design questions on earlier projects.1 AnswerWent well as most of the questions were in my comfort zone.

### Staff Software Engineer at Aruba Networks was asked...

Jul 5, 2012
 Binary search tree traversal without recursion (parent pointer provided)?1 Answeruse stack for iteratively going through nodes. //Stack S; While(1) { while(root) { //print root->data push (S,root); root = root->left; } if(isemptystack(S) return; root = Pop(S); //after left subtree, goto right subtree root = root->right; }

### Staff Software Engineer at Intuit was asked...

Jul 17, 2011
 The most challenging (and interesting) question was about a strategy for finding signal in a noisy and poorly understood data set. Asking a software engineer a data science question really stretches the mental muscles.1 AnswerChallenging yes. But not necessarily in a good way. Most software engineers do NOT have the training to properly address this question. It requires a background in "data science" or signal processing. Unless the position interviewed for required these skills/background also, I would say the question was highly inappropriate.

### Staff, Software Engineer at Roche was asked...

Dec 5, 2013
 What version number of MondoDB. The guy wanted the version number of the software. major-minor version release. Thats all. Difference between Inheritance & Composition. What is Apache Camel used for? Big(O) notation complexity for all Data Structures asked in Random like pop question. API details questions on java concurrent utils. What is LifeLock (Livelock) and DeadLock? What is the algorithm behind TreeMap? 1 AnswerThe questions were more for bookish remembering type rather than logical questions. Also it was hard to understand the strong Asian accent. Don't see a reason why any body want to remember the API. On the whole it was a bad interview format and more of Interviewer trying his best to prove he is super man than you.
110 of 113 Interview Questions