I heard a version of this was on a test to work for Microsoft at some time or something. Im having trouble working it out.
Theres four people that need to cross a bridge. Only 2 people can go across the bridge at the same time and 1 of them has to come back. 1 person takes 10 minutes, another takes 5 minutes, another 2, and another 1 minute to cross the bridge one way. You have to get them all the way across in 17 minutes. Only account for the time of the slower person and dont add it up. Ex: 1&10 cross =10 minutes, 1 comes back =11 minutes. 1&5 go across =16 minutes. 1 comes back =17 minutes. 1&2 across =19 minutes. So that goes over.
Anyone know the answer to this?

Yeah, I've tried to solve this. Can never ever do it.

I'd say you're always one minute short!

Google is known to ask these types of questions and reading some peoples responses are funny.

My solution: build a teleportation machine.

1 and 2 => 2 min
1 return => 1 min
10 and 5 => 10 min
2 return => 2 min
1 and 2 => 2 min
TOTAL => 2 + 1 + 10 + 2 + 2 = 17

edit: Original problem is slightly different than this. Any one of them can go back, not just one of the two that has just crossed the bridge.

Nice . This does resemble the problem about the duck, dog and sack of corn wih the farmer.

Oh. Wow. Thanks. I never thought about sending 10 and 5 in the middle.
First time I thought of it, I added all of them together and it comes to 18 so I figured it wasnt possible, but I figured Id ask around.