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?

A King wants to send the diamond ring to his girlfriend securely. He got multiple locks and their corresponding keys. His girlfriend does not have any keys to these locks and if he sends the key without a lock, the key can be copied in the way. How can King send the ring to his girlfriend securely?

If you were to put a coin into an empty bottle and then insert a cork into the neck, how could you remove the coin without taking out the cork or breaking the bottle?

Four people need to cross a rickety bridge at night. Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge. Times for each person: 1 min, 2 mins, 7 mins and 10 mins. What is the shortest time needed for all four of them to cross the bridge?

On rolling two dices (six-sided normal dice) together, what is the probability that the first one comes up with a 2 and the second one comes up with a 5?

An infinite number of mathematicians are standing behind a bar. The first asks the barman for half a pint of beer, the second for a quarter pint, the third an eighth, and so on. How many pints of beer will the barman need to fulfill all mathematicians' wishes?

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

Can you replace the question mark with the correct letter?

6 + 6 + 6 = N
7 + 7 + 7 = E
8 + 8 + 8 = R
0 + 0 + 0 = ?

What is the next number in the series?

15 29 56 108 208 ?

You are provided with a grid (as shown in the picture). Can you fill the squares with numbers 1-8 in a manner that none of the two consecutive numbers are placed next to each other in any direction (vertically, horizontally or diagonally?)