Puzzles:

1) ALBERT EINSTEIN'S RIDDLE ARE YOU IN THE TOP 2% OF INTELLIGENT PEOPLE IN

THE WORLD? SOLVE THE RIDDLE AND FIND OUT.
There are no tricks, just pure logic, so good luck and don't give up.
1. In a street there are five houses, painted five different colors.
2. In each house lives a person of different nationality
3. These five homeowners each drink a different kind of beverage, smoke different brand of cigar and
keep a different pet.
THE QUESTION: WHO OWNS THE FISH?
HINTS
1. The British man lives in a red house.
2. The Swedish man keeps dogs as pets.
3. The Danish man drinks tea.
4. The Green house is next to, and on the left of the White house.
5. The owner of the Green house drinks coffee.
6. The person who smokes Pall Mall rears birds.
7. The owner of the Yellow house smokes Dunhill.
8. The man living in the center house drinks milk.
9. The Norwegian lives in the first house.
10. The man who smokes Blends lives next to the one who keeps cats.
11. The man who keeps horses lives next to the man who smokes Dunhill.
12. The man who smokes Blue Master drinks beer.
13. The German smokes Prince.
14. The Norwegian lives next to the blue house.
15. The Blends smoker lives next to the one who drinks water.
Answer:
yellow->norwegian->dunhill->water->cats
blue->danish->blends->tea->horse
red->british->pall mall->milk->birds
green->german->prince->coffee->fishes
white->swedish->bluemaster->beer->dogs
So German keeps the Fishes.

2) 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 ;-)
Answer:
1/3 of the time, the door to heaven will be chosen, so 1/3 of the time it will take zero days. 1/3 of the
time, the 1-day door is chosen; of those, the right door will be chosen the next day, so 1/9 trips take 1
day. Similarly, 1/9 will take two days (choosing the 2-day door, then the right door).
After that, the cases split again, and again, and again. I cant seem to make a nice infinite sum this way,
so lets try again.
Suppose the average days spent is X. 1/3 of the cases are done in zero days as before. 1/3 of the cases
are 1 day plus X. 1/3 are 2 + X. So:
X = 1/3 * 0 + 1/3 * (1 + X) + 1/3 * (2 + X)
= 0 + 1/3 + X/3 + 2/3 + X/3
= 1 + 2X/3
Therefore,
X/3 = 1
X=3
On average, it takes three days to get to heaven. Two if the noodles are limp.
Took me one blind alley, and about five minutes.
3) There are four dogs each at the corner of a unit square. Each of the dogs starts chasing the dog in the
clockwise direction. They all run at the same speed and continuously change their direction accordingly
so that they are always heading straight towards the other dog. How long does it take for the dogs to
catch each other and where?
Ans: the dogs will meet at the center (i.e the intersection point of the diagonal).
the time taken to meet (t) =(a/sqrt(2)v).
where 'sqrt(2)v' means square root of the velocity 'v' and 'a' be the side length of the square.
4) 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

Ans:

5) A blind gnome and an evil goblin take turns to play a game. Four tumblers are placed at the corners
of a square table. The initial configuration of the tumblers (facing up or facing down) is chosen by the
evil goblin. When the blind gnome gets his turn, he is allowed to specify a subset of the four tumblers
and flip them simultaneously. To be precise, he may choose one tumbler, two diagonally opposites,
two adjacent, three tumblers or four tumblers lying in front of him, and flip them simultaneously.
After flipping, if all four tumblers are upright, he wins the game! Otherwise, the game continues and
the evil goblin is allowed to rotate the table by an amount of his choice. Can the blind gnome win the
game with a deterministic strategy?
Solution : If there were only two cards, then flip both flip one flip both would ensure a
victory for the blind gnome. For the case of four cards, let F denote all four cards, A denote two
adjacent cards, D denote two diagonally opposite cards, O denote one card. Then the following
15-step sequence ensures victory for the blind gnome: F, D, F, A, F, D, F, O, F, D, F, A, F, D, F. The
procedure can be generalized to 2^n cards. This problem is studied in detail by Ehrenborg and Skinner
(see bibliography below); they call it The Blind Bartenders Problem.
A variant of the above problem allows the blind gnome to first touch any t out of n
tumblers on a polygonal table with n sides. Touching allows the gnome to deduce which of the t
tumblers he touched are upright, and then to decide which of these t tumblers to flip. It was this variant
that was originally published in Martin Gardners article in Feb 1979. For four tumblers, the blind

gnome can win in five moves, as Gardner showed in his subsequent article in Mar 1979. The problem
generated quite some interest. Two pairs of mathematicians independently proved that the blind gnome
can win with a deterministic strategy if and only if t n(p-1)/p where p is the largest prime factor of n
(Lewis and Willard in 1980; Laaser and Ramshaw 1981). These proofs are quite involved

6) A squad of robotic rovers are to be landed by NASA on a plateau on Mars. This plateau, which is
curiously rectangular, must be navigated by the rovers so that their on-board cameras can get a
complete view of the surrounding terrain to send back to Earth.
A rover's position and location is represented by a combination of x and y co-ordinates and a
letter representing one of the four cardinal compass points. The plateau is divided up into a grid to
simplify navigation. An example position might be 0, 0, N, which means the rover is in the bottom left
corner and facing North.
In order to control a rover, NASA sends a simple string of letters. The possible letters are 'L', 'R'
and 'M'. 'L' and 'R' makes the rover spin 90 degrees left or right respectively, without moving from its
current spot. 'M' means move forward one grid point, and maintain the same heading.
Assume that the square directly North from (x, y) is (x, y+1).
INPUT:
The first line of input is the upper-right coordinates of the plateau, the lower-left coordinates are
assumed to be 0,0.
The rest of the input is information pertaining to the rovers that have been deployed. Each rover has
two lines of input. The first line gives the rover's position, and the second line is a series of instructions
telling the rover how to explore the plateau.
The position is made up of two integers and a letter separated by spaces, corresponding to the x and y
co-ordinates and the rover's orientation.

Each rover will be finished sequentially, which means that the second rover won't start to move until
the first one has finished moving.
OUTPUT:
The output for each rover should be its final co-ordinates and heading.
INPUT AND OUTPUT:
Test Input:
55
12N
LMLMLMLMM
33E
MMRMMRMRRM
Expected Output:
13N
51E
==========
SOLUTION :
Administrator removed the solution. Try your own
7) Mrs. Ram and Mrs. Jones had equal number of apples but Mrs. Jones had larger fruits and was
selling hers at the rate of two for a penny, while Mrs. Ram sold three of hers for a penny.
Mrs. Ram was for some reason called away and asked Mrs. Jones to dispose of her stock. Upon
accepting the responsibility of disposing her friend's stock, Mrs. Jones mixed them together and sold
them of at the rate of five apples for two pence.

When Mrs. Ram returned the next day the apples had all been disposed of, but when they came to
divide the proceeds they found that they were just seven pence short, and it is this shortage in the apple
or financial market which has disturbed the mathematical equilibrium for such a long period.
Supposing that they divided the money equally, each taking one-half, the problem is to tell just how
much money Mrs. Jones lost by the unfortunate partnership?
Puzzle Solution
The mixed apples were sold of at the rate of five apples for two pence. So they must have had a
multiple of five i.e. 5, 10, 15, 20, 25, 30,, 60, 65, etc apples.
But the minimum number of apples they could have together is 60; so that 30 would have been of Mrs.
Ram's that would fetch her 10 (an integer) pence and the other 30 of Mrs. Jones's that would fetch her
15 (also an integer) pence.
When sold separately it would fetch them 10+15=25 pence altogether. But when sold together it would
fetch them 60X2/5=24 pence i.e. a loss of one (25-24=1) pence.
Since they lost 7 pence altogether; they had altogether 60X7=420 apples that fetched them only
420X2/5=168 pence and they shared 84 pence each of them. But Mrs. Jones could sell her 420/2=210
apples for 210/2=105 pence so she lost "21 pence".
Note: to solve it algebraically:
They lost 7 pence altogether
Suppose each lady has x apples
x/2 + x/3 - 2(2x/5) = 7
15x + 10x - 24x = 210
x = 210
Note: Mrs. Johns lost 21 pence.
But without working Mrs. Ram earned 14 extra pence!

(84 pence 210/3 pence = 14 pence).

Not very fair!
(Perhaps Mrs. Johns was not very good at math)

8) Five friends have their gardens next to one another, where they grow three kinds of crops: fruits
(apple, pear, nut, cherry), vegetables (carrot, parsley, gourd, onion) and flowers (aster, rose, tulip, lily).
1. They grow 12 different varieties.
2. Everybody grows exactly 4 different varieties
3. Each variety is at least in one garden.
4. Only one variety is in 4 gardens.
5. Only in one garden are all 3 kinds of crops.
6. Only in one garden are all 4 varieties of one kind of crops.
7. Pear is only in the two border gardens.
8. Paul's garden is in the middle with no lily.
9. Aster grower doesn't grow vegetables.
10. Rose grower doesn't grow parsley.
11. Nuts grower has also gourd and parsley.
12. In the first garden are apples and cherries.
13. Only in two gardens are cherries.
14. Sam has onions and cherries.
15. Luke grows exactly two kinds of fruit.
16. Tulip is only in two gardens.
17. Apple is in a single garden.
18. Only in one garden next to the Zick's is parsley.
19. Sam's garden is not on the border.

20. Hank grows neither vegetables nor asters.

21. Paul has exactly three kinds of vegetable.
Who has which garden and what is grown where?

Answer :

9) A rich old man has died. After his death, his children are surprised to learn that he has left all of his
money to his oldest son Jeremiah, who loved him dearly, and ignored his other children, who hated
him.
So, the funeral is a day or two later, and the other sons and daughters have decided to kill
Jeremiah and take his inheritance. Since his father's death, Jeremiah has taken to drinking, and they
know that, at the wake, he's going to be gulping down the liquor like it was nectar of the gods. So they
decide to poison the drinks. One of the other sons, Wallace, tends bar, and gets the poison all ready. So
Jeremiah comes up, crying and depressed, and orders a scotch on the rocks. Wallace serves him one,
and he chugs it down in two seconds. "Give me another." Wallace gives him a second glass of scotch,
which he also drinks in a matter of moments. The other siblings are puzzled...the poison is fast-acting;
Jeremiah should be convulsing on the floor and retching his guts out. Finally, fifteen minutes later, a
rather inebriated and very much alive Jeremiah orders one last glass of scotch, but as Wallace hands it
to him, he changes his mind and leaves, sobbing. The other siblings come over to Wallace, and wonder
what's going on. They talk about what could have gone wrong for a few minutes, and figure the

poison's harmless. So Wallace sips the drink he poured for Jeremiah, and is pronounced DOA thirty
minutes later.
Why did Jeremiah live? (He had no immunity to the poison, he didn't know it was coming, and the
poison was obviously deadly.)
Answer :
Jeremiah orders a scotch on the rocks (ice cubes). Dropping the poison into his drink, it lands on
top of the ice cubes. Jeremiah downs his two drinks very quickly, not giving enough time for the poison
to mix with his drink. Conversely, the brother waits a "few minutes" before drinking, allowing the ice
cubes to melt and giving ample time for the poison to mix with the scotch. He is soon dead as a result!

10) 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?
Solution :

Let z-axis denote time. let x- and y- axes denote the 2D planet. Then the four trajectories are straight
lines. Since no collision involved more than two ships, these four lines must all lie in a plane. So, one
might be tempted to believe that the two other ships will also collide. But, they might have collided in
negative time. So, it cannot be decided from the given information that the two ships will collide or
not?
This can be made clearer through the following two diagrams. In the first one, the four ships move such
that there is no collision between the two ships. In the other diagram, the four ships move such that
there is a collision between them.

11) Alice places three identical boxes on a table. She has concealed a precious ruby in one of them.
The other two boxes are empty. Bob is allowed to pick one of the boxes. Among the two boxes
remaining on the table, at least one is empty. Alice then removes one empty box from the table. Bob is
now allowed to open either the box he picked, or the box lying on the table. If he opens the box with
the ruby, he gets a kiss from Alice (which he values more than the ruby, of course). What should Bob
do?
Solution:
This problem is known as the Monty Hall Problem.
If Bob switches his choice, he wins with probability of 2/3. The YouTube video explaining this
solution in detail. To get better intuition, it helps to consider a slightly different problem with 100
boxes with one box containing a ruby. Bob then picks one of the boxes at random. At least 98 of the
remaining boxes are empty these are removed by Alice. So now, we are left with two boxes: should
Bob switch? Indeed, for he wins with probability 99/100 if he switches!

12) This is another hats puzzle same like as prisoners and hats puzzle. The puzzle is Nine IIT students
were sitting in a classroom. Their professor wanted them to test. Next day the professor told all of his 9
students that he has 9 hats, The hats either red or black color. He also added that he has at least one hat

with red color and the no. of black hats is greater than the no. of red hats. The professor keeps those
hats on their heads and ask them tell me how many red and black hats the professor have? Obviously
students can not talk to each other or no written communication, or looking into each other eyes; no
such stupid options and no tricks.
Professor goes out and comes back after 20 minutes but nobody was able to answer the question. So he
gave them 10 more minuets but the result was the same. So he decides to give them final 5 minutes.
When he comes everybody was able to answer him correctly.
So what is the answer? and why?

Answer :
After 20 minutes :
Lets assume that their is 1 hat of red color and 8 hats of black color. The student with red hat on his
head can see all 8 black hats, so he knows that he must be wearing a red hat.
Now we know that after first interval nobody was able to answer the prof that means our assumption is
wrong. So there can not be 1 red and 8 black hats.
After second interval of 10 minutes :
Assume that their are 2 hats of red color and 7 hats of black color. The students with red hat on their
head can see all 7 black hats and 1 red hat, so they know that they must be wearing a red hat.
Now we know that after second interval nobody was able to answer the prof that means our assumption
is again wrong. So there can not be 2 red and 7 black hats.
After third interval of final 5 minutes :
Now assume that their is 3 hats of red color and 6 hats of black color. The students with red hat on their
head can see all 6 black hats and 2 red hats, so they know that they must be wearing a red hat.
Now we know that this time everybody was able to answer the prof that means our assumption is right.
So there are 3 red hats and 6 black hats.

Now as everybody gave the answer so there can be a doubt that only those 3 students know about it
how everybody came to know ?
Then here is what i think, the professor gave them FINAL 5 minutes to answer, so other guys will think
that the professor expects the answer after 3rd interval (according to prof it must be solved after 3
intervals), so this is the clue for others.
13) In a city, The police has surrounded the Bank. There are 50 people in the building. Each person is
either an engineer or a manager of the bank. All computer files have been deleted, and all documents
have been shredded by the managers. The problem confronting the police is to separate the people into
these two classes, so that all the managers are locked in a room and all the engineers are freed. every
people knows the status of all others. The interrogation consists entirely of asking person i if person j is
an engineer or a manager. The engineers always tell the truth. What makes it hard is that the managers
may not tell the truth. In fact, the managers are evil geniuses who are conspiring to confuse the
interrogators.
1. Under the assumption that more than half of the people are engineers, can you find a strategy for
the Police to find one engineer with at most 49 questions?
2. Is this possible in any number of questions if half the people are managers?
3. Once an engineer is found, he/she can classify everybody else. Is there a way to classify everybody
in fewer questions?
Answer :
Part 1:
Here's an n-1 query solution to part 1. Maintain three sets of people: UNSEEN, STACK, and
DISCARD. Initialize the process by picking one arbitrarily to be the STACK, everything else is
UNSEEN. Repeat the following step until UNSEEN is empty:
Pick an UNSEEN element x, remove it from UNSEEN. Ask the top of the STACK y about x. If y

says "manager" pop y off the stack and DISCARD both x and y. If it says "engineer" add x to the top of
the STACK.
After all elements have been processed in this way (n-1 comparisons), the top of the stack must be an
engineer.
Why does this work? First observe that whenever we discard a pair, at least one of them is a manager.
So among the rest of them (STACK and UNSEEN) a majority must still be engineers. So at the end,
when UNSEEN is empty, there must be an engineer in the stack, therefore the top of the stack must be
an engineer.
This can be improved to 48 simply by stopping one earlier. When there's one UNSEEN left, if the stack
is empty, that UNSEEN one is an engineer. Otherwise, the top of the stack must be an engineer.
first step we can just throw out one person, and appy this algorithm to the remaining 49 obtaining 47
comparisons. This gives the optimal algorith
This is optimal. The proof appears in the solution of homework assignment 7 of Steven Rudich's course
15-251 taught at CMU in the spring semester of 2002. See Solution 7.
Part 2: If half or more of the people are managers, then the problem cannot be solved. The managers
can ensure this simply by always lying. Now there's way to separate the two sets of people. Each one
simply claims the others are Managers.
Part 3: I don't know any better solution than to simply using the solution to Part 1 to identify everybody
14) A man is trapped in a room. The room has only two possible exits: two doors. Through the first
door there is a room constructed from magnifying glass. The blazing hot sun instantly fries anything or
anyone that enters. Through the second door there is a fire-breathing dragon. How does the man
escape?

Answer :
He waits until night time and goes out the first door.
15) In a far away land, it was known that if you drank poison, the only way to save yourself is to drink
a stronger poison, which neutralizes the weaker poison. The king that ruled the land wanted to make
sure that he possessed the strongest poison in the kingdom, in order to ensure his survival, in any
situation. So the king called the kingdom's pharmacist and the kingdom's treasurer, he gave each a
week to make the strongest poison. Then, each would drink the other one's poison, then his own, and
the one that will survive, will be the one that had the stronger poison.
The pharmacist went straight to work, but the treasurer knew he had no chance, for the pharmacist was
much more experienced in this field, so instead, he made up a plan to survive and make sure the
pharmacist dies. On the last day the pharmacist suddenly realized that the treasurer would know he had
no chance, so he must have a plan. After a little thought, the pharmacist realized what the treasurer's
plan must be, and he concocted a counter plan, to make sure he survives and the treasurer dies. When
the time came, the king summoned both of them. They drank the poisons as planned, and the treasurer
died, the pharmacist survived, and the king didn't get what he wanted.
What exactly happened there?
Answer :
The treasurer's plan was to drink a weak poison prior to the meeting with the king, and then he would
drink the pharmacist's strong poison, which would neutralize the weak poison. As his own poison he
would bring water, which will have no effect on him, but the pharmacist who would drink the water,
and then his poison would surely die. When the pharmacist figured out this plan, he decided to bring
water as well. So the treasurer who drank poison earlier, drank the pharmacist's water, then his own
water, and died of the poison he drank before. The pharmacist would drink only water, so nothing will
happen to him. And because both of them brought the king water, he didn't get a strong poison like he
wanted.

16) A woman wants to buy a painting at an auction where you bid grams of gold instead of money. She
owns a gold chain made of 23 interlocking loops, each weighing 1 gram. She wants to go to a jeweler
before the auction to cut the minimum number of loops that would allow her to pay any sum from 1 to
23. For example, she could pay a 13 gram price with a 12 link chain and a single link. After much
thought, she figures out a way to do it by cutting just 2 of the loops in the chain. How many loops are
in the pieces of chains that she has after the 2 cuts?
Answer :
Make a cut in 4 th and loops of the Gold chain so you can get pieces of 1,1,3,6 and 12. from this you
can weights from 1 to 23 grams.
17) 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?

Answer :
Dragon knows that knight cant reach well 7. So he thinks that if i give knight water from well
6 or 7, knight would die for sure. So he would get water from well 6 or 7 for knight.
Knight knew that no matter from which well he gives the water, dragon will go and drink from well 7
and live. So he got normal water for dragon and before duel drank water from well 1.
When they exchanged glasses and drank water, dragon rushed to well 7 and drank poison from it,
thinking that it would cure the poison he just drank (but he drank normal water), so dragon died. Knight
on the other hand already had poison from well 1 so what dragon gave him effectively cured him. So he
lived.
18) A remote island contains a tribe whose members have either blue or brown eyes. Tribe members do
not know the color of their eyes and if they learn it, they must kill themselves the same night. Every
member of the tribe always behaves logically. So one day, a sailor visits the island and makes an
observation that at least one of the members of the tribe has blue eyes. On the 10th night after that, all
people with blue eyes kill themselves. How many blue-eyed people were there in the tribe?
Solution :

Ten. The logic goes as follows. If there were only one person with blue eyes on the island, then
he would see that no one else has blue eyes and will kill himself on the first night. If there were two
people with blue eyes, then one of the people with blue eyes would see that the second blue-eyed
person did not kill himself on the first night, leading him to conclude that since he sees no one else with
blue eyes, he must be one of them and will kill himself on the second night. The other blue-eyed person
will follow the same logic and also kill himself on the second night. The same idea applies to the rest of
the problem.

19) http://www.techinterviewpuzzles.com/2010/08/image-puzzles-with-answers.html
20) http://www.techinterviewpuzzles.com/2010/08/infosys-interview-puzzles-with-answers.html
21) Once upon a time, There was an old lady has more number of eggs. She went to sell her vast
quantity of eggs at the local market.
When a small boy asked how many she had, she replied:
Son, I can't count past 100 but I know that.
If you divide the number of eggs by 2 there will be one egg left.
If you divide the number of eggs by 3 there will be one egg left.
If you divide the number of eggs by 4 there will be one egg left.
If you divide the number of eggs by 5 there will be one egg left.
If you divide the number of eggs by 6 there will be one egg left.
If you divide the number of eggs by 7 there will be one egg left
If you divide the number of eggs by 8 there will be one egg left.
If you divide the number of eggs by 9 there will be one egg left.
If you divide the number of eggs by 10 there will be one egg left.
Finally. If you divide the Number of eggs by 11 there will be NO EGGS left.
How many eggs did the old lady have?
22) http://www.techinterviewpuzzles.com/2010/07/image-puzzles-with-answers-ii.html
23) 9 cards are there. u have to arrange them in a 3*3 matrix. cards are of 4 colors.they are
red,yellow,blue,green. conditions for arrangement: one red card must be in first row or second row.2
green cards should be in 3rd column. Yellow cards must be in the 3 corners only. Two blue cards must
be in the 2nd row. Atleast one green card in each row.
Answer :

Yello

Red

Green

Blue

Blue

Green

Yellow Green

Yellow

24) In a soap company a soap is manufactured with 11 parts. For making one soap you will get 1 part
as scrap. At the end of the day u have 251 such scraps. From that how many soaps can be
manufactured?
Answer : 22 + 2+ 1 = 25
25) There are five thieves, each loot a bakery one after the other such that the first one takes 1/2 of the
total no. of the breads plus 1/2 of a bread. Similarly 2nd, 3rd,4th and 5fth also did the same. After the
fifth one no. of breads remained are 3. Initially how many breads were there?
Answer : 31
26) Two candles of equal lengths and of different thickness are there. The thicker one will last of six
hours. The thinner 2 hours less than the thicker one. Ramesh light the two candles at the same time.
When he went to bed he saw the thicker one is twice the length of the thinner one. For how long did
Ramesh lit two candles .
Answer : 3 hours
27) There are 5 persons who have won top 5 places in an event Olympics one of them asks all the 5
regarding their positions they reply as a: I am not the last b: c is in third place c: e is behind a d: b is in
1st place e: d is not the first find positions in order.
Answer : bdcae
28) If one tyre of a car suddenly gets stolen. and after sometime u find the tyre without the screws
how will u make ur journey complete?

Answer : Open 3 screws, 1 from each tyre and fix the tyre.

29) : How will you recognize the magnet & magnetic material & non-magnetic material?
Answer : Drag one piece of material over another. There is no attractive force in the middle portion of
the magnet. OR Get a piece of thread and tie up with the one bar and check for poles. If it iron bar then
it moves freely and if it is magnetic bar then it fix in one direction according to poles.
30) You are given a cake; one of its corner is broken. How will u cut the rest into Two equal parts?
Answer : Slice the cake
31) What is the height of room if after entering the room with a watch ur head strikes a hanging bulb?
Answer: Oscillate the hanging bulb. Calculate the time period for one complete oscillation by Simple
Harmonic Motion (SHM) of the handing bulb. Put it in the
formula T=2 * 3.14 * (L/G)^1/2
L will be the length of the hanging thread.
Add the L with ur height to get the height of the room.
OR
Drop it from the room and find the time at which it strikes the floor. Using physics formula s = (at^2)/2
(IM NOT SURE ABOUT THIS ONE)
32) Can u make 120 with 5 zeros?
Answer : Factorial (factorial (0)+factorial (0)+factorial (0)+factorial (0)+factorial (0)) = 120
33) There are three people A, B, C. Liars are of same type and Truth speaking people are of same type.
Find out who is speaking truth and who is speaking false from the following statements:

a) A says: B is a liar.
b) B says: A and C are of same type.
Answer : lets assume A is speaking truth. It means B is a liar then it means A and C are not of same
type.
34) Ann, Boobie, Cathy and Dave are at their monthly business meeting. Their occupations are author,
biologist, chemist and doctor, but not necessarily in that order. Dave just told the biologist that Cathy
was on her way with doughnuts. Ann is sitting across from the doctor and next to the chemist. The
doctor was thinking that Boobie was a goofy name for parent's to choose,but didn't say anything. What
is each person's occupation?
Answer: Since Dave spoke to the biologist and Ann sat next to the chemist and across the doctor,
Cathy must be the author and Ann the biologist. The doctor didn't speak, but David did, so Bobbie is
the doctor and Dave the chemist.
35) A man lives on the tenth floor of a building. Every day he takes the elevator to go down to the
ground floor to go to work or to go shopping. When he returns he takes the elevator to the seventh floor
and walks up the stairs to reach his apartment on the tenth floor. He hates walking so why does he do
it?
This is probably the best known and most celebrated of all lateral thinking puzzles. It is a true classic.
Although there are many possible solutions which fit the initial conditions, only the canonical answer is
truly satisfying.
Answer : The man is (of course) a dwarf. Variants of this puzzle include the clue that on rainy days he
goes up in the elevator to the tenth floor (he uses his umbrella!)

36) A man walks into a bar and asks the barman for a glass of water. The barman pulls out a gun and
points it at the man. The man says 'Thank you' and walks out.
This puzzle has claims to be the best of the genre. It is simple in its statement, absolutely baffling and
yet with a completely satisfying solution. Most people struggle very hard to solve this one yet they like
the answer when they hear it or have the satisfaction of figuring it out.
Answer : The man had hiccups. The barman recognized this from his speech and drew the gun in order
to give him a shock. It worked and cured the hiccups - so the man no longer needed the water.

The is a simple puzzle to state but a difficult one to solve. It is a perfect example of a seemingly
irrational and incongruous situation having a simple and complete explanation. Amazingly this classic
puzzle seems to work in different cultures and languages.
37) Not far from Madrid, there is a large wooden barn. The barn is completely empty except for a dead
man hanging from the middle of the central rafter. The rope around his neck is ten feet long and his feet
are three feet off the ground. The nearest wall is 20 feet away from the man. It is not possible to climb
up the walls or along the rafters. The man hanged himself. How did he do it?
Answer : He climbed on a block of ice which has since melted.
This one is often stated with the clue of a puddle of water, but surely this is too much assistance. It is
one of several problems which depend on the change of state of water (snow or ice to water or steam).
38) A man is lying dead in a field. Next to him there is an unopened package. There is no other creature
in the field. How did he die?
Answer : The man had jumped from a plane but his parachute had failed to open. It is the unopened
package. This is sometimes given with the following rather elegant clue - as he approached the centre
of the field he knew he was going to die. This is another of the top classics which is right up there with

'The Man in the Bar'. If the solver is thinking along the wrong lines (i.e. in the two dimensions of the
ground) then the lateral jump to the third dimension can be tough to make.
39) Anthony and Cleopatra are lying dead on the floor of a villa in Egypt. Nearby is a broken bowl.
There is no mark on either of their bodies and they were not poisoned. How did they die?
Answer : Anthony and Cleopatra were goldfish whose bowl was knocked over by a clumsy dog. This
is one of a set of puzzles which deceive by using human names for animals. This is not a very
satisfactory basis for a good puzzle but despite that, the puzzle has enduring popularity.
40) Five pieces of coal, a carrot and a scarf are lying on the lawn. Nobody put them on the lawn but
there is a perfectly logical reason why they should be there. What is it?
Answer : They were used by children who made a snowman. The snow has now melted. Another
change of state puzzle. After this you should be on the look-out for them.
41) A woman had two sons who were born on the same hour of the same day of the same year. But they
were not twins. How could this be so?
Answer : They were two of a set of triplets (or quadruplets etc.) This simple little puzzle stumps many
people. They try outlandish solutions involving test-tube babies or surrogate mothers. Why does the
brain search for complex solutions when there is a much simpler one available?
42) A man pushed his car. He stopped when he reached a hotel at which point he knew he was
bankrupt. Why?
Answer : He was playing Monopoly.

43) One day a man received a parcel in the post. Carefully packed inside was a human arm. He
examined it, repacked it and then sent it on to another man. The second man also carefully examined
the arm before taking it to the woods and burying it. Why did they do this?
This one probably has more variations than any other. A great one to puzzle out. It requires plenty of
good questions.
Answer : The three men had been stranded on a desert island. Desperate for food, they had agreed to
amputate their left arms in order to eat them. They swore an oath that each would have his left arm cut
off. One of them was a doctor and he cut the arms off his two companions. They were then rescued.
But his oath was still binding so he later had to have his arm amputated and sent to his colleagues.
This is often told with a further twist whereby a doctor pays a tramp a large sum in order to amputate
the tramp's arm which the doctor then sends to another man who inspects it etc. This variation can
make for a long night of questioning!
44) A man died and went to Heaven. There were thousands of other people there. They were all naked
and all looked as they did at the age of 21. He looked around to see if there was anyone he recognised.
He saw a couple and he knew immediately that they were Adam and Eve. How did he know?
Answer : He recognized Adam and Eve as the only people without navels. Because they were not born
of women, they had never had umbilical cords and therefore they never had navels. This one seems
perfectly logical but it can sometimes spark fierce theological arguments!
45) Do you Know Mice can multiply very fast This puzzle based on the Mice multiplication.
Consider an Adult mice can give birth once every month. The baby mice grow into adult mice in just
two months after they are also born. This is the condition for this puzzle.
Puzzle Question: If you would buy a baby mouse just after it was born, how many mice would you
have in 10 months?

46) This is another 2 egg puzzle same as like 2 egg puzzle asked by google. Here the number of storey
is different instead of 100 storey it is 36. The puzzle is given as
Suppose that we wish to know which windows in a 36-story building are safe to drop eggs
from, and which will cause the eggs to break on landing. We make a few assumptions:

An egg that survives a fall can be used again.

A broken egg must be discarded.

The effect of a fall is the same for all eggs.

If an egg breaks when dropped, then it would break if dropped from a higher window.

If an egg survives a fall then it would survive a shorter fall.

It is not ruled out that the first-floor windows break eggs, nor is it ruled out that the 36th-floor windows
do not cause an egg to break.
If only one egg is available and we wish to be sure of obtaining the right result, the experiment can be
carried out in only one way. Drop the egg from the first-floor window; if it survives, drop it from the
second floor window. Continue upward until it breaks. In the worst case, this method may require 36
droppings. Suppose 2 eggs are available. What is the least number of egg-droppings that is guaranteed
to work in all cases?

Solution :
The number of drop required is 8.
First i have to start dropping the egg on 8th floor, if not breaks, then 15th floor, if not breaks 21st
floor...
the series goes like this...
8,15,21,26,30,33,35,36...
i.e (8), (8+7), (8+7+6), (8+7+6+5), ....(8+7+6+5+4+3+2+1)

so in general,
the minimum value of N such that,
n(n+1)/2 >=36
so n= 8.
let us assume it breaks in 20th floor...
put down from 8 th floor - will NOT be broken
put down from 15th floor - will NOT be broken
put down from 21st floor - it will be broken.
then u have one egg remaining.
start putting from 16th floor.. ie.. 16, 17,18,19, 20
19th floor it will not be broken and
at 20th floor it will be broken.
even for the worst case scenario the maximum number of droppings required is 8.
so the answer is 8!
Moshe Sniedovich from Department of Mathematics and Statistics, The University of Melbourne
Parkville, Australia placed a paper in journal regarding this 2 egg problem. This is famous among math
teachers.
According to that paper they proposed the problem , problem introduction , Problem analysis Best case
secnario , worst case secnario etc..
Famous 2-egg puzzle from an OR/MS perspective and explore the structure of the optimal policies for
this puzzle. It is shown that the puzzle provides a vivid environment for teaching/learning basic
concepts related to decision making under uncertainty, including the differences and similarities
between the Worst Case and Expected Value scenarios. The more general problem where N test eggs
-rather than 2- are provided is also examined.

In that paper the proposed solution for 2 egg with N storey buildings they also solved the problem for
N egg for N story building in appendix. All the solution are math oriented. Click here to download the
paper as pdf.
47) Consider there are five families and their five dogs (each family member owned one of the dogs)
were hiking when they encountered a river to cross. They rented a boat which could hold three living
things people or dogs. Unfortunately, the dogs were tempermental: each was comfortable only with its
owner and could not be near another (not even momentarily) unless its owner was present. Dogs could
be with other dogs however. The crossing would have been impossible except that Lisas dog had
attended a first-rate obedience school and knew how ro operate the boat. No other dogs were that welleducated. How was the crossing arranged and how many trips did it take?
Answer :
Solution is somewhat similar to River puzzle which is already present in this blog. Try to
find and Comment your answers..
48) Frequently Asked famous Interview Riddles :
1. You wake up one morning and theres been a power outage. You know you have 12 black socks and
8 blue ones. How many socks do you need to pull out before youve got a match?
2. Why are manhole covers round?
3. Youre trying to get to Truthtown. You come to a fork in the road. One road leads to Truthtown
(where everyone tells the truth), the other to Liartown (where everyone lies). At the fork in the road is a
man from one of those towns -- but which one? You get to ask him one question to discover the way.
Whats the question?
4. How many cubes are at the center of a Rubiks Cube?

5. You have two containers, one holds five gallons, the other holds three. You can have as much water
as you want. Measure exactly four gallons of water into the five gallon container.
6. The government is building a highway through your neighborhood and youre forced to sell your
home. How do you arrive at your asking price?
7. There are eight balls, one of which is slightly heavier than the others. You have a two-armed scale,
which you are allowed to use only twice. Find the ball thats heavier.
8. Calculate the number of degrees between the hour hand and the minute hand of a clock (nondigital)
that reads 3:15.
9. How many barbers are there in Chicago?
10. You are in solitary confinement. It is Friday afternoon and you absolutely must have a cigarette.
The only person who can give you one is the guard outside your cell. What do you do?

Interview Riddles - Answers

1. Pick three -- there are only two colors.
2. Manhole covers are round so that they dont fall into the manholes.
3. To find the way to Truthtown, ask the man, Which way is your hometown? Then, go whichever
way he points: If hes from Liartown, hell point to Truthtown, and if hes from Truthtown, hell point
to Truthtown.
4. There is only one cube at the center of a Rubiks Cube.

5. Fill up the three-gallon container and pour it into the five-gallon container. Do it again -- there will
be one gallon left in the three-gallon container. Empty the five, pour in the one, fill the three again and
pour it into the firve-gallon container -- you have four!
6. Calculate the price of your home using conventional valuation methods - but remember to throw in
the value you attach to your memories for however long youve lived there.
7. Put three balls on each side of the scale. If the arms are equal, you know the heavy ball is one of the
two remaining. If the arms are unequal, take the three balls on the heavier side, pick two and weigh
them against each other.
8. The hour hand will have moved one-fourth of an hour; therefore, there will be 7.5 degrees between
the two hands.
9. The variables youll want to consider are the population of Chicago and the percentage thats male;
the number of haircuts the average male has per year divided by the number of days in the year, taking
into account the number of days per year baber shops are open; and the number of haircuts an average
barber can give per day. At the time of writing this up, there are 550 barber shops in Chicago; 6273
active barbers in Illinois; with 66% of the states population, Chicago has roughly 4140 barbers.
10. To get the guard to give you a cigarette (and this really is the preferred answer to this question),
threaten to kill yourself by smashing your head against the wall of your cell. That gives you leverage
with the guard - hed be tied up by doing paperwork about your suicide, so hed miss weekend time
with his family (its Friday afternoon, remember?) -- so hell give you a cigarette.

49) This is another coin puzzle. As per the puzzle you have 20 coin machines, each of which produce
the same kind of coin. you know how much a coin is supposed to weigh. one of the machines is
defective, in that every coin it produces weighs 1 ounce less than it is supposed to. you also have an
electronic weighing machine. how can you determine which of the 20 machines is defective with only

one weighing? (by one use, we mean you put a bunch of stuff on the machine and read a number, and
that's it -- you not allowed to accumulate weight onto the machine and watch the numbers ascend,
because that's just like multiple weighings). you are allowed to crank out as many coins from each
machine as you like.
This puzzle is like another coins puzzle (Box of Defective balls...) But It's solution is somewhat
different. In other coins puzzle you can weigh number of times. But here it is only once. Try to think
differently and post your answers..
Answer :
In case of normal coin puzzle they ask number if times required to use the balance to find the
answer. Here it is different. Here you can use only one time the balance.
The solution is to take the coins in the following order. Take one coin from the first machine,
two coins from the second machine, three coin from the third mechine etc.. So that totally you can take
(20 * (20+1) )/2 = 210 coins. Lets consider each coins have 10 ounce weight except one machine coins.
So totally you have 2100 ounce weight for 210 coins. If you weigh it now you can get less weight
because one machine produces less weight. From the weight you can find the machine which produces
less weight coins. Suppose the resultant weight is 2099 then the first machine is fault. If it is 2098 then
second machine is fault. That is the fault machine number = 2100 - Obtained weight from balance.

50) The warden meets with 23 new prisoners when they arrive. He tells them, "You may meet today
and plan a strategy. But after today, you will be in isolated cells and will have no communication with
one another.
"In the prison is a switch room, which contains two light switches labeled 1 and 2, each of which can
be in either up or the down position. I am not telling you their present positions. The switches are not
connected to anything.

"After today, from time to time whenever I feel so inclined, I will select one prisoner at random and
escort him to the switch room. This prisoner will select one of the two switches and reverse its position.
He must flip one switch when he visits the switch room, and may only flip one of the switches. Then
he'll be led back to his cell.
"No one else will be allowed to alter the switches until I lead the next prisoner into the switch room.
I'm going to choose prisoners at random. I may choose the same guy three times in a row, or I may
jump around and come back. I will not touch the switches, if I wanted you dead you would already be
dead.
"Given enough time, everyone will eventually visit the switch room the same number of times as
everyone else. At any time, anyone may declare to me, 'We have all visited the switch room.'
"If it is true, then you will all be set free. If it is false, and somebody has not yet visited the switch
room, you will all die horribly. You will be carefully monitored, and any attempt to break any of these
rules will result in instant death to all of you"
What is the strategy they come up with so that they can be free?
Solution:
The team nominates a leader. The group agrees upon the following rules:
The leader is the only person who will announce that everyone has visited the switch room. All the
prisoners (except for the leader) will flip the first switch up at their very first opportunity, and again on
the second opportunity. If the first switch is already up, or they have already flipped the first switch up
two times, they will then flip the second switch. Only the leader may flip the first switch down, if the
first switch is already down, then the leader will flip the second switch. The leader remembers how
many times he has flipped the first switch down. Once the leader has flipped the first switch down 44
times, he announces that all have visited the room.

It does not matter how many times a prisoner has visited the room, in which order the prisoners were
sent or even if the first switch was initially up. Once the leader has flipped the switch down 44 times
then the leader knows everyone has visited the room. If the switch was initially down, then all 22
prisoners will flip the switch up twice. If the switch was initially up, then there will be one prisoner
who only flips the switch up once and the rest will flip it up twice.
The prisoners can not be certain that all have visited the room after the leader flips the switch down 23
times, as the first 12 prisoners plus the leader might be taken to the room 24 times before anyone else is
allowed into the room. Because the initial state of the switch might be up, the prisoners must flip the
first switch up twice. If they decide to flip it up only once, the leader will not know if he should count
to 22 or 23.
In the example of three prisoners, the leader must flip the first switch down three times to be sure all
prisoners have visited the room, twice for the two other prisoners and once more in case the switch was
initially up.
51)