A man was convicted of a minor offence in Akbar court. Akbar decided to give him a chance. He asked him to give a statement. If the statement is true, he will be killed by lions and if it is false, he will be killed by trampling of wild elephants.
The convicted person requested help from Birbal and since the crime was not a big one, Birbal decided to help him. Whatever Birbal suggested impressed Kabir and he let the convicted person go.
You are a cab driver who pools passengers. You pick 3 people from a destination and drop 1 after an hour. 2 people climb aboard at the same time and you drop 3 at the next destination. After some time, you pick 2 passengers only to drop 1 after a short distance where 3 more passengers climb up the cab. You leave the rest of the passengers one by one to their destination and then come back home.
One night, a man runs away from home. He turns left and keeps running. After some time he turns left again and keeps running. Later, he turns left one more time and runs back home—but when he gets home, he finds a man in a mask. Who was the man in the mask?
I can sizzle like bacon,
I am made with an egg,
I have plenty of backbone, but lack a good leg,
I peel layers like onions, but still remain whole,
I can be long, like a flagpole, yet fit in a hole.
A man had five children. He had $100 with him to give to his children. He decided to start with the youngest child and then give $2 more than each younger child to his next elder child.
For example, if he gives $x to the youngest child, he will give $(x+2) to the next one, $[(x+2) + 2] to the next one and so on.
Can you find out how much did the youngest one receive?
There are hundred red gems and hundred blue gems. The blue gems are priceless while the red gems equal wastage. You have two sacks one labeled Heads and the other Tails. You have to distribute the gems as you want in the two sacks. Then a coin will be flipped and you will be asked to pick up a gem randomly from the corresponding sacks.
How will you distribute the gems between the sacks so that the odds of picking a Blue gem are maximum?
In the image below, you can see two glasses and two matchsticks.You need to move four matchsticks in such a manner that the crosses come inside the glasses. Note: you cannot move the crossed.
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.
