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.
Standard and simple questions, no tricks.
Second Interview: Write a function that takes an integer and returns true if the integer is a palindrome and false otherwise
First interview: Given a node in a binary search tree, find its successor (the next highest number). Assume that each node has a parent pointer.
What is the hardest part of current position
What is the fewest slices it will take to make 8 slices of a cake?
What is a semaphore? Can you have a pointer to a function? What is a pointer used for? A double pointer?
Data structures. Design large int class, a Trie and a recursion problem.
Please describe to me a time that where you faced immense opposition and persevered to accomplish your goal.
Describe the TCP/IP Model and its layers
Viewing 351 - 360 interview questions