I have one of the three numbers: 1, 2, or 3 in my mind. I speak only truth. You can ask me just one question for which I will only reply in yes or no or don't know. What question will you ask from me so that you are able to know the number?
Once upon a time, there was a castle on a square island. The entire island was surrounded by a 14m wide trench. The Romans had wanted to invade the castle and had brought a few wooden planks along with them to facilitate themselves in crossing the moat. The planks were however found to be only 13m long.
The Romans still managed to cross the trench. How did they do it?
Two fathers and two sons decided to go to a shop and buy some sweets upon reaching. Each of them bought 1 kg of sweet. All of them returned home after some time and found out that they had 3kg of sweets with them.
They did not eat the sweets in the way, nor threw or lose anything. Then, how can this be possible?
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?
All of you like to eat me. I am a five-lettered word. Remove the first two and I turn into an infamous animal. Remove just the first and I become a heinous crime. Remove the first and the last and you can groove on me.