There is a circular car race track of 10km. There are two cars, Car A and Car B. And they are at the exact opposite end to each other. At Time T(0), Both cars move toward each other at a constant speed of 100 m/seconds. As we know both cars are at the same speed they will always be the exact opposite to each other.
Note, at the center, there is a bug which starts flying towards Car A at time T(0). When the bug reaches car B, it turns back and starts moving towards the car A. The speed of bug is 1m/second. After 5 hours all three stop moving.
What is the total distance covered by the bug?

John has eleven friends. He has a bowl containing eleven apples. Now He wants to divide the eleven apples among his friends, in such a way that an apple should remain in his bowl.
How can He do it?

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?)

Solve the below puzzle by replacing the question mark with the correct number.

3 6 12

4 8 16

5 10 ?

Today is John's birthday.
A year ago, John had five candles and he lit all the candles except the one at the last.
Now he is going to light all the candles.

How old is John Today?

(He is not five today.....)

Can you solve the equation by finding the value of
A) Horse
B) Cowboy boot
C) Horseshoe

In the Picture?

John was writing his first book. After saving the document, he locked his laptop with a password and mentioned some phrases for the hint box.

A friend of his tried opening his laptop but found out that it was password protected. Following is the hint that appeared.
1 mobile 3 books 2 roars 1 night 4 balls 2 lighters 1 ghost 1 hat 3 watches.

Can you help him in cracking the password?

100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?

You are on your way to visit your Friend, who lives at the end of the hill. It is his birthday, and you want to give him the cakes you have made. Between your house and his house, you have to cross 5 bridges, and as it goes in the land of make believe, there is a troll under every bridge! Each troll, quite rightly, insists that you pay a troll toll. Before you can cross their bridge, you have to give them half of the cakes you are carrying, but as they are kind trolls, they each give you back a single cake. How many cakes do you have to leave home to make sure that you arrive at a friend's house with exactly two

A maths symbol is hidden in the below Bar Graph. Can you decipher it?