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?
Is this valid/what would this do (C): int *p; p=0; p++; printf("%d",p);
given 2 unsigned ints a and b, return 1 unsigned int = a/b, rounded to nearest int without float operation
Implement the functions for a stack and function getMinimum() all with O(1) complexity.
Print a binary search tree. Each level on a new line.
How can one implement a queue with only a stack implementation?
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))
write a function which returns a fibonacci number for a given number n.
Viewing 1011 - 1020 interview questions