(following the previous one) You got only TWO baby bottle sample. You would like to know the max height you can drop it without breaking the bottle. Let set the unit as 1 foot. And the highest height you can reach is at N feet. So how would you find the (max) safe height? (This is the one I think is kind of brain-teaser one.)
Write an algorithm to see if a tree is a BST.
How would you find the pairs of numbers that added to some specific number in an array.
Find all anagrams in a file. Improve the running time to O(n).
Having an infinite supply of water and two containers, one for 3 liters and one for 5 liters, how would you measure 4 liters?
You put a glass of water on a record turntable and begin slowly increasing the speed. What happens first - does the glass slide off, tip over, or does the water splash out.
Tell me about yourself. How do you see yourself 5 years from now. What is your weakness.
Puzzle: There are 25 horses and 5 lanes for conducting a race among them. In a minimum of how many races, would be able to find out the 3 fastest horses among them? Assumption: Speed of horses are consistent enough across races.
In Javascript, how would you make a variable read-only?
Question Description: Write a function that, given a list of integers (both positive and negative) returns the sum of the contiguous subsequence with maximum sum. Thus, given the sequence (1, 2, -4, 1, 3, -2, 3, -1) it should return 5.
Viewing 451 - 460 interview questions