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?

Which is the smallest number that you can write using all the vowels exactly once?

If 1+9+8=1, what is 2+8+9?

Replace the question mark with the correct number.

2 + 2= 4
3 + 3= 18
4 + 4= 48
5 + 5= ?

Jim and Sarah are in a long-distance relationship. Jim buys an engagement ring for Sarah and wants to mail it to her. Unfortunately, the only way to ensure the ring will be received is to place a lock on the package. Jim has locks and Sarah has locks, but neither has keys for each other’s locks. How can they make sure the ring isn’t stolen?

Solve the following series:
AZ, GT, MN, __, YB

You are given four results as below:
1111 = F
2222 = E
3333 = T
Then, can you find out how to code 4444?

Five teams were competing in cricket where they faced each other exactly once. After the tournament, the following is the point table.

DareDevils 6
SuperKings 5
Royals 4
Sunrisers 2
Riders ?

How many points did Riders end up with?

You have two rectangular wires.

Both of them have property that when you light the fire from one end , it will take 60 minutes to get completely burn.

However, they do not burn at consistent speed (i.e it might be possible 1st 20% burn in 50 minutes and 80% can burn in 10 minutes).

So how could you measure 45 minutes ?

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?