# Development Interview Questions

Sort: Popular Date
Sort: Popular Date

Did you mean companies matching "Development"?  See Companies

### Financial Software Developer at Bloomberg L.P.

Feb 15, 2010
 “Out of 25 horses, pick the fastest 3 horses. In each race, only 5 horses can run at the same time. What is the minimum number of races required?”

### Leadership Development Program Associate at Acosta

Mar 23, 2011
 “Just entertain me for five minutes, I'm not going to talk”

### Software Developer Position at RockYou

Feb 10, 2010
 “Given 5 pirates on a ship, they need to distribute a pot of gold that has 100 gold pieces inside of it. The first pirate must make a proposal of how the gold will be distributed. If he receives over...”

### Financial Software Developer at Bloomberg L.P.

May 17, 2010
 “A frog is at the bottom of a 30 meter well. Each day he summons enough energy for one 3 meter leap up the well. Exhausted, he then hangs there for the rest of the day. At night, while he is asleep...”

### Financial Software Developer at Bloomberg L.P.

Oct 1, 2010
 1 of 1 found helpful
 “An array of 99 elements contains integers from 1 to 100 with one missing element. Find the missing element.”

### Product Development at Amazon.com

Jan 9, 2012
 0 of 1 found helpful
 “"Jeff Bezos walks into your office and says you can have a million dollars to launch your best entrepreneurial idea. What is it?"”

### Business Development Engineer at Palantir Technologies

Nov 8, 2009
 “Given a fleet of 50 trucks, each with a full fuel tank and a range of 100 miles, how far can you deliver a payload? You can transfer the payload from truck to truck, and you can transfer fuel from...”

### Software Development Engineer at Amazon.com

Dec 9, 2011
 “Write an algorithm to determine if 2 linked lists intersect”

### Quantitative Developer at Bank of America

Jul 31, 2009
 1 of 1 found helpful
 “How to measure 9 minutes using only a 4 minute and 7 minute hourglass”

### Software Development Engineer at Amazon.com

Oct 15, 2009
 “Find the deepest common ancestor of two nodes in a tree structure.”
110 of 15,210 Interview Questions