Given an input stream of an indeterminate length, how do you return a random member of that stream (with equal probability for each), given that you're not allowed to store more than a constant number of inputs, and you can only go through the inputs once.
1.How much testers working? If you tell 4 testers , he will ask why 4 too many.. If you tell two why only two he will ask? 2.Why your company dont have agile? 3.If you tell that you have stand up meeting in non agile, he will ask, in agile only stand up meeting happen, he will reply.. The thing is stand up meeting is normal in all company, it is not a goverment policy that Agile process only has stand up meeting.. 4. What is your project dead line? 5.Do you have any fight with your team lead? So you planned to quit?
Do an in-order BST walk without additional data structures and without recursion.
nothing was difficult. He did ask me questions like "how many balls can fit in a car"..and find a root-cause problem..
Nothing was difficult. They are very helpful and will help you solve the problem.
Write a C procedure to reverse a string in-place.
Given a sorted array, find how many times a specified element appears.
Search smallest value from a tree. What if you have enough memory, how to improve the speed?
Given an array of numbers, there is one number that has a duplicate. How would you find the number?
Find if there are two members of an array that sum to 10 (10 and 0 count, but 10 alone does not).
Viewing 921 - 930 interview questions