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?
John was running from 40 thieves. John has got 3 gold boxes which weigh as 4kg, 2kg, and 1kg respectively. A witty man asked John to stay with him for seven days in exchange for 1kg gold per day. John needs to stay there for seven days and also do not want to give the witty man any advance. How can John pay for his seven days stay?
Take number 1000 and then add 20 to it.
Now add 1000 one more time.
Now add 30.
Now add 1000 one more time.
Now add 40.
Now add 1000 one more time.
Now add 10.
If we tell you that there is a relation between the numbers and letters in the given figure, can you analyze it and find the missing letter in the last box?
An American nightclub called 'The Coconut Grove' had a terrible fire in which over 400 people died. A simple design flaw in the building led to a high death toll. Subsequently, regulations were changed to ensure that all public buildings throughout the country eliminated this one detail, which proved deadly. What was it?
John went to a parrot shop in Mexico, and the parrot owner told him that his parrot is so unique that he repeats everything he hears. John got excited and immediately bought the parrot. John went home and spoke many words, but the parrot does not repeat anything.
He went again to the parrot shop and complaint to the shopkeeper, but the shopkeeper never lied. Explain?
In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki