The King of a distant land had heard that Birbal was one of the wisest men in the East and so desired to meet Birbal. He sent Birbal an invitation to visit his country.
In due course, Birbal arrived in the distant kingdom. When he entered the palace he was flabbergasted to find not one but six kings seated there. All looked alike. All were dressed in kingly robes. Who was the real king?
The very next moment he got his answer. Confidently, he approached the king and bowed to him.
Speaking of rivers, a man calls his dog from the opposite side of the river. The dog crosses the river without getting wet, and without using a bridge or boat. How?
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?
You have to fill the below given grid in a manner that every row and column contains the digits 1 to 6. Also, make sure that the squares that are connected with each other must contains the same digit.
John drives to his office at 20km/hr. After reaching the office, he realizes that today is a holiday. He went back at an average speed of 30km/hr. Discounting the time spent in the stoppage what was the average speed of his journey?
Four people need to cross a rickety 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?
Three fair coins are tossed in the air and they land with heads up. Can you calculate the chances that when they are tossed again, two coins will again land with heads up?
In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?