Sort array of integers (positive, zero and negatives) so that the negatives are first, then the zeros, then the positive numbers while ensuring that the order of the individual groups stay the same. I.e. order groups but keep original order of internal elements of each group.
They asked me to create an algorithm to find all the strongly connected components of a graph.
It was easy interview, just be confident
There is a common type of word puzzle where you are given two English words of the same length, say, "HEAD" and "TAIL". The puzzle is to come up with a sequence of valid English words, starting with "HEAD", and ending with "TAIL", such that each word is formed by changing a single letter of the previous word. Create an algorithm to automatically solve such puzzles.
The design you proposed me seems fine to me, it will probably work. Though, let's imagine that someone comes to you saying he dislikes it and ask you to change it. What do you do ?
The questions are not very difficult.
Graph and tree related questions
What was a time where you were unable to complete a project/assignment due to time constraints, and how did you deal with it?
Perform a depth first search on a binary tree.
Write code to find the subtree of a tree which sums to the largest value.
Viewing 1541 - 1550 interview questions