Can you solve this amazing hard number series problem?
7, 8, 10, 12, 16, 18 ?

What are the 50th, 63rd and 100th numbers in the sequence below?
4, 5, 8, 8, 9, 9, 12, 13, 13, 13, 17, 18, ...

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?

What number should come in place of the question mark below?

John, Jack and Jill are in a desert. John doesn't like Jill and hence decides to murder him. He poisons the water supply of Jill. Since it is a desert area, Jill must drink or he will die of thirst.

Jack does not know of the actions of John and also decides to murder Jill. To succeed in his ill motives, he removes the water supply of Jill so he dies of thirst.

Jill dies due to thirst. Who murdered Jill?

Can you find the missing letter in the sequence?
S - T - I - L - ? - T - F - Y - C

A king sentenced a man to the death sentence for some crime he had committed. Known for his kindness, the king told the culprit that he had a choice to die in a way he decides.

The culprit was clever and said something that saved him from death. What method do you think he must have chosen for his death?

You know three triplets: Frank John and Wayne (need to return your money). Frank always tells the truth while John and Wayne always lie. You meet one of them on the road and can ask him a three-word question.
Which question, will you ask?

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?

Evil warlock dislikes dwarfs and therefore he selects four of them and buries them. The dwarfs are buried in the ground and they are in such a way that except for their heads, their body is inside the ground. The dwarfs cannot move their body and they can view only forward. They are all buried in a line, and amongst the four, one of the dwarfs is separated by a wall. All the dwarfs are in the same direction. The last dwarfs can see two heads of friends in the front and a wall. In the last second dwarf can see one head of his friend and a wall. The second dwarf can see only the wall. The dwarf can see nothing.
Warlock comprehends the situation and tells the dwarfs that he has placed hats on their heads. There are two blue hats and two red ones. In all four dwarfs, one of them has to say what colour hat he is wearing. If the dwarf says the correct colour of the hat, they will be left free. If the answer is wrong, then they will be dug inside the ground till the very end.

What will be the answer by the dwarf and how will they answer?