you have 100 doors in a row that are all initially closed. you make 100 passes by the doors starting with the first door every time. the first time through you visit every door and toggle the door (if the door is closed, you open it, if its open, you close it). the second time you only visit every 2nd door (door #2, #4, #6). the third time, every 3rd door (door #3, #6, #9), etc, until you only visit the 100th door.
Create a Priority Queue with all methods.
given an unsigned char array, find if there is a subarray whose elements sum up to a given value
Remove all characters of a string from another string. The algorithm should be less than O(m*n) where m & n are lengths of strings and the space used should be less than O(m+n).
Find the next node in a binary tree from any node (implying successor to a node)
How to come out of a maze given that you can move one step at a time and you cannot turn left.
Whiteboard programming: given a tile and a word, write a routine to determine if the word is valid. Wild card "*" might be present in tile and can be used for once when there is no match. For example, "bed" is valid given tile "abcdefg". "bread" is valid given tile "abcdefg*".
How many windows APIs do you remember?
reverse a linked-list
Write a program to find out in a sorted array the sum of any two numbers present in the array is closest to the a number given. if you have an array 4, 6, 8,24,36 and the given number is 31 then output should be 24 + 6 = 30
Viewing 461 - 470 interview questions