Given an integer array, write a program that returns an array with elements = product of the integers in input array except the one in its position. Ex: Given input: [2, 3, 10, 4, 5], output: [600, 400, 120, 300, 240] What is the complexity of your program? When will your program not work? Below is what I presented (O(n)), but it did not qualify me for the next round.
How can I add value in the next two years?
public class Person { Person father; Person mother; Gender gender; Integer age; List<Person> children; int level = 0; public enum Gender { Male, Female; } } For the above class, you basically have to implement 2 methods. public List<Person> getOldestSisters() public List<Person> getGreatestAncestors()
given 8 coins and one of them heavier than the others, how many weighings will be needed to find the odd one ?
What's your strengths for this position
Given unsorted array, find the 2 max numbers in it.
Whiteboard a solution to enhancing the experience of driving a car.
If you want to distribute a large file (gigabytes) in a large (100+ machines) park how do you do it?
This is the strange part about the whole process...I didn't see any of the questions as being "difficult" or "unexpected". I felt that I aced the interviews and then was shot down!
Why leave current employer Tell me about yourself
Viewing 101 - 110 interview questions