You have 25 horses, and you want to know which are the top 3 fastest, but you don't have a stopwatch. You can race the horses, but the track is only big enough to fit 5 horses at a time. How do you find the first, second and third fastest horses using the least amount of races possible?
whats is the difference between merge and join .
decide whether the enter should be accepted or not for a passcode, one number missing is permitted, can be missed several times, 18687 is the passcode, then 167 is accepted, the rest should be right and in right sequence.
How many characters in the front of a string would need to be added in order to make it a palindrome.
given a matrix, you can move right or down only and cost of each move is 1. Find an optimal way to reach to right-bottom from top-left of the matrix.
given 2 unsigned ints a and b, return 1 unsigned int = a/b, rounded to nearest int without float operation
Implement memcpy.
They asked me to do a recursive function of a powerset (Ex. powerset(a,b,c) = ((),(a),(b),(c),(a,b),(a,c),(b,c))
Phone interview questions: Given an array of numbers (1,2,3,8,0,2,2,0,10), move all 0s to the right end and all other numbers to the left while keeping relative order of non-zero numbers. Has to be linear in time and in-place.
Some questions on graph theory and then I was asked to write a function to check if a graph was bipartite.
Viewing 1371 - 1380 interview questions