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.
Write a function to delete all nodes from a linked list that match an input value. Provide test cases.
Design the service similar to bit.ly
Why do you choose to shift from business to computer science when you were applying college? (I mean, no technical question becomes more difficult than this one.)
print the matrix in spiral format (inside out). Not that difficult, but challenging if you have not heard of the question before (as was the case with me)
X==NULL and NULL==x, what is the difference
Write a function to determine if a tree is a BST.
one question is to find a path in a maze
Find all black regions on image, flood algorithm. OO design a address book.
Nothing too difficult or unexpected
Viewing 181 - 190 interview questions