Académique Documents
Professionnel Documents
Culture Documents
Every man in a village of 100 married couples has cheated on his wife. Every wife in the
village instantly knows when a man other than her husband has cheated, but does not
know when her own husband has. The village has a law that does not allow for adultery.
Any wife who can prove that her husband is unfaithful must kill him that very day. The
women of the village would never disobey this law. One day, the queen of the village
visits and announces that at least one husband has been unfaithful. What happens?
3) Rope Bridges
Four people need to cross a rickety rope bridge to get back to their camp at night.
Unfortunately, they only have one flashlight and it only has enough light left for
seventeen minutes. The bridge is too dangerous to cross without a flashlight, and it's
only strong enough to support two people at any given time. Each of the campers walks
at a different speed. One can cross the bridge in 1 minute, another in 2 minutes, the third
in 5 minutes, and the slow poke takes 10 minutes to cross. How do the campers make it
across in 17 minutes?
You have a set of 3 light switches outside a closed door. One of them controls the light
inside the room. With the door closed from outside the room, you can turn the light
switches on or off as many times as you would like.
You can go into the room - one time only - to see the light. You cannot see the whether
the light is on or off from outside the room, nor can you change the light switches while
inside the room.
No one else is in the room to help you. The room has no windows.
Based on the information above, how would you determine which of the three light
switches controls the light inside the room?
6) Mislabeled Jars
This problem is also called Jelly Beans problem. You have three jars that are all
mislabeled. one contains apples, another has grapes, and the third has a mix of both.
Now you are allowed to open any one jar and you can able to see one fruit. [ The jar you
are open may contain one fruit or two fruit. but you could able to see only one fruit and
you can't find weather the opened jar has one or two fruit]. How could you fix the labels
on the jars ?
7) Heaven Puzzle
A person dies, and he arrives at the gate to heaven. There are three doors in the heaven.
one of them leads to heaven. another one leads to a 1-day stay at hell, and then back to
the gate, and the other leads to a 2-day stay at hell, and then back to the gate. every time
the person is back at the gate, the three doors are reshuffled. How long will it take the
person to reach heaven?
this is a probability question - i.e. it is solvable and has nothing to do with religion, being
sneaky, or how au dente the pasta might be.
Imagine there are infinite number of Queens (Chess Game Piece) with u. Find the
minimum number of queens required so that every square grid on the chess board is
under the attack of a queen. Arrange this minimum no. of Queens on a chess board.
Four ships are sailing on a 2D planet in four different directions. Each ships traverses a
straight line at constant speed. No two ships are traveling parallel to each other. Their
journeys started at some time in the distant past. Sometimes, a pair of ships collides. A
ship continues its journey even after a collision. However, it is strong enough only to
survive two collisions; it dies when it collides a third time. The situation is grim. Five of
six possible collisions have already taken place (no collision involved more than 2 ships)
and two ships are out of commission. What fate awaits the remaining two?
The warden may choose the same prisoner more than one time and he will be choosing
completely randomly. But at a certain point of time, everyone will have visited the switch
room. And at any time, the prisoners may declare that everyone has visited the room at
least once. If they will be true, they will be set free but if they will be wrong, they will be
killed.
The warden gives them an hour to plan any kind of strategy and then they will be
confined to their respective cells and will never be allowed to meet. What strategy can
help them be free?
You are provided with twenty five different horses and you must find out who are the
fastest horses. You can conduct a race of five horses only at one time. There is no point in
the race where you can find out the actual speed of a horse in a race.
How many races will it take to help you determine the fastest three horses?
This is another one famous puzzle asked in many interview puzzle. This was asked in
Trilogy interview.
Lets consider a dragon and knight live on an island. That island has seven poisoned
wells, which is numbered 1 to 7. If you drink from a well, you can only save yourself by
drinking from a higher numbered well. The Well whose is number 7 is located at the top
of a high that mountain, so only the dragon can reach it.
One day they decide that the island isn't big enough for the two of them, and they have a
duel. Each of them brings a glass of water to the duel, they exchange glasses, and drink.
After the duel, the knight lives and the dragon dies.
Why did the knight live? Why did the dragon die?
Bill: The product of their ages is 72 and the sum of their ages is the same as your birth
date.
Jack: Cool But I still dont know.
Bill: Sorry, I need to pick my eldest kid from his school.
Jack: Oh now I get it.
A bad king has a cellar of 1000 bottles of delightful and very expensive wine. A
neighboring queen plots to kill the bad king and sends a servant to poison the wine.
Fortunately (or say unfortunately) the bad kings guards catch the servant after he has
only poisoned one bottle. Alas, the guards dont know which bottle but know that the
poison is so strong that even if diluted 100,000 times it would still kill the king.
Furthermore, it takes one month to have an effect. The bad king decides he will get some
of the prisoners in his vast dungeons to drink the wine. Being a clever bad king he knows
he needs to murder no more than 10 prisoners believing he can fob off such a low
death rate and will still be able to drink the rest of the wine (999 bottles) at his
anniversary party in 5 weeks time. Explain what is in mind of the king, how will he be
able to do so ? (of course he has less then 1000 prisoners in his prisons)
According to the story, four prisoners are arrested for a crime, but the jail is full and the
jailer has nowhere to put them. He eventually comes up with the solution of giving them
a puzzle so if they succeed they can go free but if they fail they are executed.
The jailer puts three of the men sitting in a line. The fourth man is put behind a screen
(or in a separate room). He gives all four men party hats (as in diagram). The jailer
explains that there are two red and two blue hats; that each prisoner is wearing one of
the hats; and that each of the prisoners only see the hats in front of them but not on
themselves or behind. The fourth man behind the screen can't see or be seen by any
other prisoner. No communication between the prisoners is allowed.
If any prisoner can figure out and say to the jailer what color hat he has on his head all
four prisoners go free. If any prisoner suggests an incorrect answer, all four prisoners
are executed. The puzzle is to find how the prisoners can escape, regardless of how the
jailer distributes the hats.
And finally....
Three gods A, B, and C are called, in no particular order, True, False, and Random. True
always speaks truly, False always speaks falsely, but whether Random speaks truly or
falsely is a completely random matter. Your task is to determine the identities of A, B,
and C by asking three yes-no questions; each question must be put to exactly one god.
The gods understand English, but will answer all questions in their own language, in
which the words for yes and noare da and ja, in some order. You do not know which
word means which.
P.S.: I haven't given the solutions for each as they are available online and it would make
my answer TLTR. Please post the answer in comments with unique solutions....
Hope you enjoy them!
Updated 23 Feb. 129,022 views.
Upvoted3.6k
Downvote
Comments65+
Share64