If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.
There is a jar in which there are two types of candies.
20 blueberries and 16 strawberries. You perform the following steps:
1) You take out two candies.
2) If the two candies are of the same flavour, you add a blueberry one otherwise, you add the strawberry one.
You repeat these two steps till there is just one candy remaining in the jar. Which flavoured candy will be left?
I have one of the three numbers: 1, 2, or 3 in my mind. I speak only truth. You can ask me just one question for which I will only reply in yes or no or don't know. What question will you ask from me so that you are able to know the number?
A Japanese ship was en route to a mission on foreign seas. The captain of the ship felt tired and thought of taking a bath. He went for taking the shower and removed his diamond ring and Rolex and kept them on the table. When he returned after taking the bath, he found that the ring and watch were stolen.
He called the five members of the crew whom he suspected and asked them what they were doing for the last 15 minutes.
The Italian cook (with a butcher knife in hand): I was in the fridge room getting meat for cooking.
The British Engineer (with a high beam torch in hand): I was working on a generator engine.
The Pakistani seaman: I was on the mast correcting the flag which was upside down by mistake.
The Indian Radio officer: I was trying to make a contact with the company to inform them about our position.
The American navigation officer: I am on night watch, so I was sleeping in my cabin.
Upon listening to them, the captain caught the lying member. Who do you think stole the valuables?
Artificial Intelligence has crushed all human records in the puzzle game “2048,” achieving a high score of 839,732 and beating the game in only 973 moves without using any undo.
