Given an array of n coins, determine the minimum number of flips for all coins to have the same side (all heads or all tails).
Developer Database Oracle Interview Questions
710,966 developer database oracle interview questions shared by candidates
Give the type of a binary tree and an algorithm to compute its depth
I had not expected to be asked logic questions, which made me nervous. The first one was a weigh nine items on a balancing scale to find the odd one out in the fewest scale uses
He asked me about Linked List vs Arrays? I have not thought much about this since freshman year of college.
What is your age
You have one billion numbers, implement getRandom() which returns a random number from them. Constaints: 1. No duplicate returning value. 2. getRandom() will at most be invoked 100 million times. Then optimize for space.
I was asked to write a program to find common items between 2 lists.I used java to write the program. I wrote the program which was iterating the smaller array list and used contains. The Hiring manager argues with me saying that the code is not efficient enough because 'contains' method on arraylist would lead to o(n) and that would result in O(m*N)(which is incorrect) In the interview, I was not able to google it and I was taken aback when he was talking so assertively as I assumed that he understands java. However, after I hung up the phone I realized that I am indeed right and that the algorithm I created was very efficient. The interviewer came to the interview with a view to reject me. Its a waste of time. They should let subject mattter experts do the interviews, not the people with background in c/C++ interview java guys or the other way round. The hiring manager seemed very professorial background. I tried to tell recruiter to let them know the problem, but I do not think even she has any clue on how to approach.
Unusual sort: sort an array A such that: A[0]<A[1]>A[2]<A[3]>A[4]<A[5].............
Implement a power function similar to pow() function of c.
You're given a binary tree and pointers to two nodes in the tree. Describe the fastest algorithm you can come up with to determine the closest common ancestor.
Viewing 1331 - 1340 interview questions