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?

A Car is crossing a bridge 2 miles long. The bridge can only hold 10000 lbs, which is the exact weight of the car. The Car makes it half way across the bridge and stops. A bird lands on the car. Does the bridge collapse? Explain.

What does this mean?

CCCCCCC

Some friends went on a vacation to a resort. It was raining heavily and it kept raining for thirteen days.

When it rained in the morning, the afternoon was beautiful and when it rained in the afternoon, the day was blessed with a clear morning.

Overall, the friends experienced eleven nice mornings and twelve nice afternoons. Can you find out the number of days they spent on vacation?

Spot the cat in the picture below

In the following series, a set of numbers is progressing with a particular pattern. Can you deduce that pattern and find the missing set?

(2 + 6), (21 + 6), (58 + 6), (119 + 6), ___

John and Jill are madly in love with each other. To remind Jill of his pure love, John wants to send her a ring by post but in their country where burglary is quite prominent, any package that is not locked comes under the risk of being stolen for the contents.

John and Jill possess many padlocks but neither one of them has the other key.

Can you find a way John can send the ring to Jill safely?

John is the son of Jacob.
So,
Jacob is the_____of John's father?

A beggar on the street can make one cigarette out of every 6 cigarette butts he finds. After one whole day of searching and checking public ashtrays the beggar finds a total of 72 cigarette butts. How many cigarettes can he make and smoke from the butts he found?

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?