Given a BS tree, give the median number in the tree with O(1) space.
Engineer Interview Questions
843,597 engineer interview questions shared by candidates
Write a function in Java that will take a sorted array of ints, possibly with duplicates, and compact the array removing all the duplicate numbers. That is, if the contains the numbers - 1, 3, 7, 7, 8, 9, 9, 9, 10, then when the function returns, the contents should be - 1, 3, 7, 8, 9, 10. Be sure your answer is as efficient as possible. Describe the efficiency of your algorithm using big O notation.
How can you efficiently detect whether two linked lists converged? If they do, how do you identify at which node this occurs?
If a 3x3 white cube is painted blue on its face and then cut into 1x1 cube, what are the chances of picking a cube with a blue side from a bag
List of n number with k numbers missing. How do you identify the missing numbers? What is the run time?
What does "$?" mean in bash?
Take a paragraph as Input and output the top three most repeated words
Given an array a contains all digits 0-9 a = [1, 4, 2, 1] # which represents 1421 Add one to the number and return the array return a = [1, 4, 2, 2] # which represents 1422
Except experience related questions I was asked coding question and I was supposed to write the solution to the problem in any programming language in a simple web-based code editor. The question was: given and array of positive integers and another integer find whether there is a consecutive range in the array, so that the sum of integers in the range is equal to the given number. They put an emphasis on delivering working, efficient solution. In my opinion this kind of interview requires a thorough preparation.
Given a string, remove all chars from the string that are present in say another string called filter.
Viewing 871 - 880 interview questions