Given two arrays of sorted integers, how would you find the minimum difference in O(n) time.
Developer Database Oracle Interview Questions
711,100 developer database oracle interview questions shared by candidates
how many blocks on an n x n megablock are not on the edge?
25 racehorse question. Given 25 horses a track that can only race 5 at a time, what is the fewest # of races to find the top 3 ranked horses?
How do you reverse a linked list
Given a list of 1,000,000 integer (1 to 1,000,000 with no repeat), how to sort the list with only 1 mb of memory space.
Find the kth largest element in a sorted 2D array (the rows are sorted and the columns are sorted).
Linked list memory management: deleting a node from the middle of a list was easy. Next question - how to delete a node from the end of a list. Was too tired to think and realize this was a trick question.
It was a question about graphics / topology - how to do lines between a few points drawn on the whiteboard without the lines crossing each other.
What's the fastest way to tell if 2 signed floats are the same polarity?
Phone Interview 1: (1)Find maximum height of BST. This is easy using recursion. Then he asked me to do it iteratively, which I somehow managed to solve. (2)The Dutch flag problem. This was not tough. But the next question was tough. It was about finding particular keys in a dictionary. They have a custom function that tells you if a key is in the dictionary and you to find out if for given input, you get required output. For example -- The dictionary is like: {hi,hello,sir,how, are, you} And you have a function isWord(x) that tells you if a particular word is in that dictinary. So if the input is hisirhowareyou the output must be hi sir how are you I couldn't solve this problem. :(
Viewing 1671 - 1680 interview questions