A swan sits at the center of a perfectly circular lake. At an edge of the lake stands a ravenous monster waiting to devour the swan. The monster can not enter the water, but it will run around the circumference of the lake to try to catch the swan as soon as it reaches the shore. The monster moves at 4 times the speed of the swan, and it will always move in the direction along the shore that brings it closer to the swan the quickest. Both the swan and the the monster can change directions in an instant.
The swan knows that if it can reach the lake's shore without the monster right on top of it, it can instantly escape into the surrounding forest.

How can the swan successfully escape?

You need to complete the maze by entering from the entrance marked below in the figure near the yellow circle, bottom left and leaving from the exit point near the green circle, bottom middle.

Rule of Game: You can move only by exchanging green and yellow circles.

Trying to tease Birbal, Akbar gave him one gold coin and ask him to buy
* something for him to eat
* something for him to drink.
* something to feed the cows
* something to plant in the garden
and most important you need to buy only one thing.

What must Birbal buy to silence Akbar?

I am a ten letters word
The first four letters have the power to rule,
Next, four-letter can be eaten.
The next three-letter represents a lady.
I can fly as well

what am I looking for?

A man is approaching a broad and barren land. He has a package with him. If somehow, he is unable to open the package before reaching the land, he will die.

Can you guess what is present in the package?

Find The Next Number in the series:

12 13 15 17 111 113 117 119 123 ?

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?

There were two grandmothers and their two granddaughters.
There were two husbands and their two wives.
There were two fathers and their two daughters.
There were two mothers and their two sons.
There were two maidens and their two mothers.
There were two sisters and their two brothers.
Yet there are only six, who are buried here,
All are born legitimate and relationships clear.
How can this happen?

Eight of us go fourth, not back, to protect our king from an attack. What are we?

10 people came into a hotel with 9 rooms and each guest wanted his own room. The bellboy solved this problem.
He asked the tenth guest to wait for a little with the first guest in room number 1. So in the first room, there were two people. The bellboy took the third guest to room number 2, the fourth to number 3, ..., and the ninth guest to room number 8. Then he returned to room number 1 and took the tenth guest to room number 9, still vacant.
How can everybody have his own room?