A wicked sorcerer felt enmity towards elf and thus he chooses four among the rest of the elf's and concealed them. The elves are concealed in the ground in a manner that apart from their head the rest of their body was underneath the ground. The elf's are unable to move their body and can only see in that direction that they are facing. All the elf's are concealed underground in such a way that they form a straight line and among those four elf's that are concealed underground one of the elf is detached form the other three elf's via wall. The entire elf's are in the same direction. The elf that is the furthest can only see the heads of its friends in front and a wall. The elf that is second last can only see one head of his friend and a wall. The second elf can only view the wall. The elf can see nothing.
The sorcerer understands the situation and tells the elf's that he has placed hats over their heads. Among the hats places two hat are blue and the other two are red. Among all the four elfs one of the elf has to guess that which colour hat is he wearing. If the elf answers correctly then he shall be set free or else he will have to dig beneath the ground till the very last.
f the last elf is taking some time to answer the question then it shall mean that the elf's before him are all wearing distinct coloured hats. However sufficient time shall be given to the last elf to give the answer.
If he views the similar coloured hats in front of him , he shall quickly tell the answer
There are three bags.The first bag has two blue rocks. The second bag has two red rocks. The third bag has a blue and a red rock. All bags are labeled but all labels are wrong.You are allowed to open one bag, pick one rock at random, see its color and put it back into the bag, without seeing the color of the other rock.
How many such operations are necessary to correctly label the bags ?
Four friends need to cross a dangerous bridge at night. Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. 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: 1 min, 2 mins, 7 mins and 10 mins. What is the shortest time needed for all four of them to cross the bridge?
The initial solution most people will think of is to use the fastest person as an usher to guide everyone across. How long would that take? 10 + 1 + 7 + 1 + 2 = 21 mins. Is that it? No. That would make this question too simple even as a warm up question.
Let’s brainstorm a little further. To reduce the amount of time, we should find a way for 10 and 7 to go together. If they cross together, then we need one of them to come back to get the others. That would not be ideal. How do we get around that? Maybe we can have 1 waiting on the other side to bring the torch back. Ahaa, we are getting closer. The fastest way to get 1 across and be back is to use 2 to usher 1 across. So let’s put all this together.
1 and 2 go cross
2 comes back
7 and 10 go across
1 comes back
1 and 2 go across (done)
You can place weights on both side of weighing balance and you need to measure all weights between 1 and 1000. For example if you have weights 1 and 3,now you can measure 1,3 and 4 like earlier case, and also you can measure 2,by placing 3 on one side and 1 on the side which contain the substance to be weighed. So question again is how many minimum weights and of what denominations you need to measure all weights from 1kg to 1000kg.
Three college toppers are summoned by the inspecting faculty. To identify the best from them, the faculty takes them into a room and places one hat on each of their heads. Now all of them can see the hats on other’s heads but can’t see his own. There are two colored hats – green and red.
Now the faculty announces that he had made sure that the competition is extremely fair to all three of them. He also gives them a hint that at least one of them is wearing a red hat. Now the first one who is able to deduce his own hat color will be awarded the most intelligent student of all award. After a few minutes, one of them raises his hand and is able to deduce the color correctly.
There are two things to keep in mind:
Firstly there is at least one red hat. (There can be two or three as well).
Secondly the competition is fair for everyone.
Thus if there is only one red hat, that person will see two green hats on other heads and will be able to deduce his own color as red. However the other students will see one red and one green hat and can never be sure. In such manner, the competition will prove to be partial for one student.
Suppose if there are two red hats. Then the students who are wearing red hats will see one red and one green hat on others. Now they must have deduced that there can’t be just one red hat. Thus they will know that they are also wearing a red hat. But the one who is wearing a green hat will see two red hats and can never be sure of his own color. In this case as well, the competition will not be fair.
Thus the only possible and fair means is if all of them are wearing a red hat. The one who is able to deduce the situation first, will raise his hand and will tell the correct answer.