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 Doctor always sneezes before the rain. Doctor sneezes, Will it rain?

I always drive my customer away.

Who am I?

A man is trapped in a room. The room has only two possible exits doors. Through the first door there is a room constructed from magnifying glass. The blazing hot sun instantly fries anything or anyone that enters. Through the second door there is a fire-breathing dragon. How does the man escape?

The owner of a popular clothing store comes up with his own method of pricing items. A vest costs $8, socks cost $10, a tie costs $6, and a blouse costs $12. Using the owner’s method, how much would a pair of underwear cost?

Replace the letters of words with a number so that the below equation holds true

BASE +
BALL
---------
GAMES
----------

John went to a parrot shop in Mexico, and the parrot owner told him that his parrot is so unique that he repeats everything he hears. John got excited and immediately bought the parrot. John went home and spoke many words, but the parrot does not repeat anything.
He went again to the parrot shop and complaint to the shopkeeper, but the shopkeeper never lied. Explain?

There is a box full of marbles,
all but two are blue,
all but two are green,
and all but two are red.

How many marbles are in the box?

You are given with the following sum. Each of the letters can be decoded as a digit. If we tell you that D = 5, then can you solve it entirely?

DONALD
+GERALD
=ROBERT

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?