Three People on a Weak Bridge

Three people need to cross a weak bridge at night. They have just one turn and the bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge. Times for each person: 2 min, 5 mins and 7 mins. What is the shortest… Read More »

Server to Process Fair Number of Functions

How would you design a server that has to process a fair number of functions of a requests in a second? What if you are not aware of how many requests you will be getting? What if requests has different priorities?

Fruit Jar Problem

You have 3 jars that are all mislabeled. One jar contains Apple, another contains Oranges and the third jar contains a mixture of both Apple and Oranges. You are allowed to pick as many fruits as you want from each jar to fix the labels on the jars. What is the minimum number of fruits… Read More »

A Man with Burning Ropes

A man has two ropes of varying thickness, those two ropes are not identical, they aren’t the same density nor the same length nor the same width. Each rope burns in 60 minutes. How can he measure 45 mins using only these two ropes. He can’t cut the one rope in half because the ropes… Read More »