There are one hundred closed lockers in a hallway. A man begins by opening all one hundred lockers. Next, he closes every second locker. Then he goes to every third locker and closes it if it is open or opens it if it is closed (e.g., he toggles every third locker). After his one hundredth pass in the hallway, in which he toggles only locker number one hundred, how many lockers are open?
Given a list of strings, determine if there are any anagrams. What is the running time of your algorithm?
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
Suppose there is a building with 25 floors. If n-1 people enter an elevator and press a floor button. What is the probability that when the nth person enters, the 19th floor has already been pressed?
Implement a function to raise a number to an exponent using your language of choice.
Write a program that given a 2D integer matrix (default value: 0) and a coordinate in the matrix, it sets all of the elements diagonal to the coordinate to a value of 1 (so that if you wrote it on a piece of paper there's an X with the coordinate at the center).
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?
Viewing 281 - 290 interview questions