Implement the functions for a stack and function getMinimum() all with O(1) complexity.
Informatic Interview Questions
666,682 informatic interview questions shared by candidates
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.
Some questions on graph theory and then I was asked to write a function to check if a graph was bipartite.
The most unexpected question was when they asked me to provide them the result of 2 to the power of 8. Really?
given a chess board that is 3 x 3 squares, and only one piece, the knight, write a program that will move the knight from any starting location to any other (given) location in the board and return an error if it can not.
Viewing 1181 - 1190 interview questions