The coding problem he asked me was to find the next larger element in a BST.
Development Engineer Interview Questions
37,128 development engineer interview questions shared by candidates
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.
The good ol' triangle problem.
Being only the first interview, there were no hard questions, but they asked why I liked library A or library B and such questions.
merge two sorted arrays in sorted order?
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++)
One example that I thought was interesting: given a list of points, find the line that goes through the greatest number of them.
Array, Tree, Dynamic Programming questions
How many people can you stuff in a school bus
Suppose you have a C++ base class and several classes that inherit from it. What might happen if you do not write a virtual destructor for the base class?
Viewing 1041 - 1050 interview questions