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?

Which digit occurred maximum times between the number 1 and 1000?

The day after tomorrow will be three days before Tuesday. Can you find out what is today?

If 2 workers can complete painting 2 walls in exactly 2 hours.

How many workers would be needed to paint 18 walls in 6 hours?

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?

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.

Today, I celebrated my 32nd birthday but I was born in 1972.
How is this possible?

Can you find out what is missing?

1 3 5
2 4 ?

Hint: It's not six. Think out of the box.

I have thought of a number that is made up by using all the ten digits just once. Here are a few clues for you to guess my number:

First digits is divisible by 1.
First two digits are divisible by 2.
First three digits are divisible by 3.
First four digits are divisible by 4.
First five digits are divisible by 5.
First six digits are divisible by 6.
First seven digits are divisible by 7.
First eight digits are divisible by 8.
First nine digits are divisible by 9.
The number is divisible by 10.

Can you find out the number ?

You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?