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.
You are provided with a grid (as shown in the picture). Can you fill the squares with numbers 1-8 in a manner that none of the two consecutive numbers are placed next to each other in any direction (vertically, horizontally or diagonally?)
During a secret mission, an agent gave the following code to the higher authorities
AIM DUE OAT TIE MOD
However, the information is in one word only and the rest are fake. To assist the authorities in understanding better, he also sent them a clue, If I tell you any one character of the code, you can easily find out the number of vowels in the codeword.
One day, all the courtiers from Akbar's court were gathered in the assembly hall when one of them told the Emperor that all his valuables had been stolen by a thief the previous night.
This shocked the Emperor to his core as the place where that courter stayed was the most secured in the kingdom. The Emperor thought that it is not at all possible for an outsider to enter into the courtier's house and steal the valuables. Only another courtier could commit this crime. He quickly called Birbal to identify the thief.
Birbal thought for a while and successfully solved the mystery by identifying the thief in just one statement.
What did Birbal say?
A family is trapped in a jungle. There is a bridge which can lead them to safety. But at one time, the bridge can only allow two people to pass through. Also, all of them are afraid of the dark and thus, they can't go alone.
Father takes 1 minute to cross, the mother takes 2 minutes, the son takes 4 and the daughter takes 5 minutes. While crossing the time taken will be according to the slower one. How can they all reach the other side in the minimum possible time?
How many people must be gathered together in a room, before you can be certain that there is a greater than 50/50 chance that at least two of them have the same birthday?
