N people are sitting in a circle labelled 1 through n. They being counting 1,2,3,.... in a clockwise manner and every person that gets a number divisible by 3 is eliminated. Write a program to figure out which numbered person will remain. What's the time and space complexity?
Implement the fibonacci sequence
Reverse the individual words in a string (words are delimited by spaces). Example - "Hello world" becomes "olleH dlrow".
Diagonally flip a two dimensional array.
Given the root of a binary search tree, link all the nodes at the same level, by using an additional Node* level.
How can you write a recursive function calculating the exponential of a number?
Reserve link listed pair-wise
Phone interview question: What happens when the "new" operator in C++ fails?
Consider n people with random birthdays. How large does n need to be before there is at least a 50% chance that two people have the same birthday?
Shuffle Linked List
Viewing 641 - 650 interview questions