# Puzzle Archives :: Interview Puzzles

**Home**>

**Puzzle Archives**>

**Interview Puzzles**>

**Puzzle List**

**Add New Interview Puzzles**

* Practice Sets *

* Puzzles Archives Co. *

* Co. Cloud *

- Question :: 1
Sahil has got a challenging problem from his friend Akhil. Sahil has to find all values of n for which one can fill an n × n table with +’s and -’s (one per cell) so that every cell has

**exactly**one neighbor with the opposite sign. Two cells are considered neighbors if they are either in the same row or the same column. Can you help out Sahil to find such values of n?

No Best Answer on this question yet!

Not Yet Asked in Any of the Companies

- Question :: 2
Alok has three daughters. His friend Shyam wants to know the ages of his daughters. Alok gives him the first hint.

1) The product of their ages is 72.

Shyam says this is not enough information Alok gives him a second hint.

2) The sum of their ages is equal to my house number.

Shyam goes out and look at the house number and tells "I still do not have enough information to determine the ages".

Alok admits that Shyam cannot guess and gives him the third hint

3) The oldest of the girls like strawberry ice-cream.

Shyam is able to guess after the third hint. Can you guess what are the ages of three daughters?

No Best Answer on this question yet!

Not Yet Asked in Any of the Companies

- Question :: 3
You have 240 barrels of wine, one of which has been poisoned. After drinking the poisoned wine, one dies within 24 hours. You have 5 slaves whom you are willing to sacrifice in order to determine which barrel contains the poisoned wine. How do you achieve this in 48 hours?

- Question :: 4
A king wants his daughter to marry the smartest of 3 extremely intelligent young princes, and so the king's wise men devised an intelligence test.

The princes are gathered into a room and seated, facing one another, and are shown 2 black hats and 3 white hats. They are blindfolded, and 1 hat is placed on each of their heads, with the remaining hats hidden in a different room.

The king tells them that the first prince to deduce the color of his hat without removing it or looking at it will marry his daughter. A wrong guess will mean death. The blindfolds are then removed.

You are one of the princes. You see 2 white hats on the other prince's heads. After some time you realize that the other prince's are unable to deduce the color of their hat, or are unwilling to guess. What color is your hat?

Note: You know that your competitors are very intelligent and want nothing more than to marry the princess. You also know that the king is a man of his word, and he has said that the test is a

of intelligence and bravery.*fair test*

No Best Answer on this question yet!

Not Yet Asked in Any of the Companies

- Question :: 5
A certain town comprises of 100 married couples. Everyone in the town lives by the following rule: If a husband cheats on his wife, the husband is executed as soon as his wife reports about him to the mayor. No woman can report about other’s husband. Every woman in the town knows about all the cheating husbands in the town except her own. One day, the mayor of the town announces to the whole town that there is at least 1 cheating husband in the town. How many days it will take to find out 19 Cheaters from the day of the announcement?

No Best Answer on this question yet!

**Asked In :**Sapient - Question :: 6
There are 100 doors they are all closed.

A Person walks through these 100 doors 100 times. Each time he toggles some of the doors. ( Toggles - close if open, open if close )

In the first walk, he will toggle all the doors.

In the second walk, he will toggle every second door, i.e., 2nd, 4th, 6th, 8th and so on

In the third walk, he will toggle every third door, i.e. 3rd, 6th, 9th and so on,

So after 100th Walk, what all door will be open?

No Best Answer on this question yet!

**Asked In :**Alcatel-Lucent - Question :: 7
**The Monty Hall Puzzle**You are the contestant on a Game Show. There are 3 doors – say A,B and C – and behind one door is the prize of a million dollars. The prize is randomly placed and the probability of finding the prize behind any door is 1/3.

You get to pick one door and if you’ve picked the right door, you win the prize.

There’s a catch. After you’ve chosen a door, the game show host will not immediately open that particular door. The host will open another door that you did not pick and which he knows does not contain the prize. Suppose you had picked door A, and the prize is behind door B, the host will open door C and let you know that there is nothing being door C.

At this point, you will be given a choice: Do you want to stick with your original choice (door A in the example above) or do you want to choose the other unopened door (door B in this example)?

**Would you switch your choice?**

No Best Answer on this question yet!

**Asked In :**Infosys - Question :: 8
# The Ultimate Balance Puzzle

There are 12 balls, one of which is different in weight (can be heavier or lighter)

Find the oddball using less than 3 weightings of the balance.

- Question :: 9
# Missionaries and Cannibals

Three missionaries and three cannibals must cross a river. There is a single boat which can carry a maximum of two people and there must be at least one person on board (the boat cannot cross by itself).

On either bank, if there are missionaries present, the count of missionaries must be equal or greater than the count of cannibals, else the cannibals would eat them.

- Question :: 10
**25 horses 5 track Puzzle**There are 25 horses out of which you need to find the fastest 3 horses. The race ground consists of 5 tracks that mean you can run only 5 horses at a time. If you don't have a stopwatch. What is the minimum number of races required to find the fastest 3 horses?

No Best Answer on this question yet!

**Asked In :**Accenture

Puzzle test enable the companies to check the Logical skills of a candidate. Check out these Puzzle topics with answers for the interview! You can choose a topic and speak up your mind through a Gmail type editor.