A time long back, there lived a king who ruled the great kingdom of Trojan House. As a part of the renovation of the kingdom to meet future security needs, he asked his chief architect to lay down a new play in a manner that all of his 10 castles are connected through five straight walls and each wall must connect four castles together. He also asked the architect that at least one of his castles should be protected with walls. The architect could not come up with any solution that served all of King's choices, but he suggested the best plan that you can see in the picture below. Can you find a better solution to serve the king's demand?

Solve the equation by replacing the alphabet with numbers.

MOM + MOM + NO = BOOK=

What time is it when an elephant sits on a fence?

You have two strings whose only known property is that when you light one end of either string it takes exactly one hour to burn. The rate at which the strings will burn is completely random and each string is different.

How do you measure 45 minutes?

Count the number of lines in the image below ?

Things are just as they seem, right? Well, check again.
Can you count the number of tigers in this picture ?

Okay before we begin with the puzzle, do keep in mind that you have to answer it quickly.

You are participating in a car race. Seeking the perfect moment, you overtake the second person in the race. What positions are you in now?

Jessica is telling her friends this story and asks them to guess if it’s the truth or a lie: “There was a man sitting in a house at night that had no lights on at all. There was no lamp, no candle, and no other source of light. Yet, he sat in the house and read his book happily.” Her friends say she’s lying, but Jessica corrects them and says she’s telling the truth. Jessica’s story is true—but how?

Three people enter a room and have a green or blue hat placed on their heads. They cannot see their own hat but can see the other hats.
The colour of each hat is purely random. They could all be green, blue, or any combination of green and blue.
They need to guess their own hat colour by writing it on a piece of paper, or they can write 'pass'.
They cannot communicate with each other in any way once the game starts. But they can have a strategy meeting before the game.
If at least one of them guesses correctly they win $10,000 each, but if anyone guesses incorrectly they all get nothing.
What is the best strategy?

I am the black child of a white father, a wingless bird, flying even to the clouds of heaven. I give birth to tears of mourning in pupils that meet me, even though there is no cause for grief, and at once on my birth, I am dissolved into air. What am I?