This was a question that I already encountered at another company. You have three lightbulbs in one room and three switches in another room. You can play with the switches as much as you want to, but you can only visit the room withthe bulbs once. How can you determine which switch corresponds to which bulb?
There are 20 floors in a building. I step into the elevator with 5 other people. What is the probability that I do not have to press my button? (ie someone else chooses the same floor as me)
#1: We have a linked list, but it is special in that it can have pointers down, as well as next. Any node can have an arbitrary number of links down as well as across. Write a function that will "flatten" this linked list so that it does not have any down pointers, but all elements remain in order.
Some problems were quite difficult for this position. Maybe the interviewers didn't like me personally. Check if two linked list intersect, if so, find the intersection point. Travelling salesman problem.
Classic one from them: You have an array and you want to find the first non-repeating element.
If you have all the companies that are traded, and live inputs are coming of which company is being traded and what is the volume, how do you maintain the data, so that you can carry out operation of giving the top 10 most traded companies by volume of shares most efficiently.
unsorted integer array size n. unmodifiable list of "less than" / "greater than" operators. place elements from int array in between each "<" and ">" operator so that every comparison holds true. e.g. 6, 2, 8, 1, 3, 9, 4, 0, 5, 7 <, >, <, <, <, >, <, >, > answer: 0 < 9 > 1 < 2 < 3 < 8 > 4 < 7 > 6 > 5
1) Find the intersection of two arrays as a set. 2) Find the mirror or a binary tree. 3) Find the first non unique character in a stream of potentially infinite data.
Algorithm runtime analysis: What's the complexity of computing the fibonacci numbers?
Implement a queue class.
Viewing 421 - 430 interview questions