Find if a word is anagram (e.g. ana is an anagram).
Developer Support Engineer Interview Questions
1,134,729 developer support engineer interview questions shared by candidates
how many scale measurements does it take to know which ball out of 8 balls weighs more? Then how many does 28 balls take?
If water in a well rises 2 feet each day and falls 1 foot each night, how long til the water reaches the top of a 10 foot well
In puzzle test , a small town, there are three temples in a row and a well in front of each temple. A pilgrim came to the town with certain number of flowers. Before entering the first temple, he washed all the flowers he had with the water of well. To his surprise, flowers doubled. He offered few flowers to the God in the first temple and moved to the second temple. Here also, before entering the temple he washed the remaining flowers with the water of well. And again his flowers doubled. He offered few flowers to the God in second temple and moved to the third temple. Here also, his flowers doubled after washing them with water. He offered few flowers to the God in third temple. There were no flowers left when pilgrim came out of third temple and he offered same number of flowers to the God in all three temples. What is the minimum number of flowers the pilgrim had initially? How many flower did he offer to each God?
My strengths and weaknesses
First, a mathematic question, asking about a card game with how many possible way for the combination based on the rules it given. Second, let you to print out all the combination of 3 digit numbers with no duplicate, ex. 012, 013, ....123, 124, 125...
Implement a class that can calculate the running average of a stream of input numbers up to a maximum of N numbers.
Intersection of n sets without using a hash table.
Get numeric number out of a roman string, linear time Given: mapping I = 1, V = 5, X = 10, L = 50, C = 100, D = 500, M = 1000 Input/Output: II = 2, III = 3, IV = 4 VI, VII, VIII IX = 9 XL = 40, XLIX = 49
The initial question (writing a function to calculate a square root) ended up being the most difficult because it threw me off. I knew there was a good iterative method for doing so, but could not recall Newton's method in the moment, and I sadly let this nagging thought get in the way of my ability to work through the problem. My failure to perform well on that question set a negative tone for the rest of the interview, since each interviewer after the first can see notes from the previous interviewers.
Viewing 271 - 280 interview questions