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*".
You have a building with 100 stories. You also have two glass balls. You can drop the glass balls as many times as you want before they break. How can you find the floor at which they start breaking with the fewest number of drops?
How to test a clock
Create a Priority Queue with all methods.
based on user input, return an updating list of us cities as the user types. example: user input = s return= san fran, san antonio, seattle.... user input = e return = seattle, seguela, sebba... and so on
Given a balance and marbles where one marble weighs more than the other, how many times do you have to use the balance to find the heaviest marble for 7 marbles. Then, extend that answer to how many marbles can you weigh with 4 tries.
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).
You have an array of length n consisting of the integers from 0 through n-1 exactly once each, except for one which is missing. Find the missing number. The numbers can be in any order.
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.
A rotated sorted array (e.g. 34512), find the rotation count (in this case, 3 means rotated by 3).
Viewing 481 - 490 interview questions