A time long back, there lived a king who ruled the great kingdom of Trojan House. As a part of the renovation of the kingdom to meet future security needs, he asked his chief architect to lay down a new play in a manner that all of his 10 castles are connected through five straight walls and each wall must connect four castles together. He also asked the architect that at least one of his castles should be protected with walls. The architect could not come up with any solution that served all of King's choices, but he suggested the best plan that you can see in the picture below. Can you find a better solution to serve the king's demand?

What are the next two letters in the following series and why?
W A T N T L I T F S _ _

*Hint: Check Puzzle Title

Replace The Question Mark Below With the Correct Number.

2 {38} 3
4 {1524} 5
6 {3548} 7
8 {????} 9

Suppose we lay down two cups in front of you. One of the cups is filled with tea and the other one with coffee. Now we ask you to take a spoonful of tea and mix it with the coffee. At this moment, the coffee cup has a mixture of tea and coffee. You have to take that mixture (spoonful) and add it back to the tea.

Can you now tell if the cup of coffee has more tea or the cup of tea has more coffee?

Steffi's daughter Jazelle needs to be picked up from school every day.
Steffi asks one of her colleagues to pick up Jazelle from the school. Steffi devised a password system to confirm that Jazelle goes with the correct colleague only.

The password on Monday was SJM16.
The password on Wednesday was TAW39.

What will the password be for Friday?

Before reading ahead, you must know the fact that only one of the people here is telling the truth.

A says that B is lying.
B says that C is lying.
C says both A and B are lying.

Can you find out who is speaking the truth?

13 decks of cards have been mixed. What is the minimum number of cards that must be taken out from the above-mixed cards to guarantee at least one 'four of a kind?

If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.

What is the four-digit number in which the first digit is one-third the second, the third is the sum of the first two, and the last is three times the second?

You are playing a game with your friend Jack. There are digits from 1 to 9. You both will take turn erasing one digit and adding it to your score. The first one to score 15 points will win the game.

Would you want to play first or second?

PS: The sum should be exactly 15.