Given a tree of order n which is neither complete or a search tree, write a function to construct a new tree of order m in-place. Memory usage is bound to 2 times the size of the tree. The new tree must be complete, and a node A cannot be a child of another node B in the new tree if A was an ancestor of B in the old tree.
Given a random array, how can you find the median without using any know sorting algorithm?
How will you implement word ladder puzzle
Propose an algorithm to remove duplicates in very large datset (which cannot be completely stored in memory for processing). Now, give scenarios in which your algorithm fails.
Being only the first interview, there were no hard questions, but they asked why I liked library A or library B and such questions.
The good ol' triangle problem.
Which cycle performs quickier? for (int i=0; i<1000; i++) for (int j=0;j<100;j++) or for (int i=0; i<100; i++) for (int j=0;j<1000;j++)
Reverse the words in a string.
I got a brain teaser question that how can I make the most number of triangles with 9 wooden stick.
Given an array with integers, return the array so that it will not have any consecutive duplicates.
Viewing 1091 - 1100 interview questions