Write a program that takes in a string and removes any duplicate spaces (including leading and trailing spaces – there should be none when finished). This program should not have any embedded loops, and you can only traverse the string ONCE. Should definitely be faster than O(n^2).
During lunch, one interviewer asked me how I would test a pencil to prepare it for release.
What problems will you point out in any products of Microsoft if you're going to improve it?
Find all the words that you can identify associated to a telephone number.
Given a linked list, swap every pair of elements (so elements 1 and 2 swap, 3 and 4 swap, etc.)
How would you test Excel?
how to find the closest predecessor of a node in binary by doing inorder traversal.
Implement enqueue and dequeue using stacks.
Write an algorithm to pick the mayor of a town. There is a random number that is chosen and every nth person on the list is deleted until the mayor is chosen.
Code a solution to rotate bitmap by 90 degrees given a structure definition representing the bitmap and a function prototype for the function to do the rotation.
Viewing 351 - 360 interview questions