Talking without Word

How can one talk without saying a single word?




Similar Riddles

I am white when I am dirty, and black when I am clean. What am I?

Asked by Neha on 31 Mar 2022


Trying to tease Birbal, Akbar gave him one gold coin and ask him to buy
* something for him to eat
* something for him to drink.
* something to feed the cows
* something to plant in the garden
and most important you need to buy only one thing.

What must Birbal buy to silence Akbar?

Asked by Neha on 10 May 2021

Its something that each of us devours,
Not just us but birds, beats, trees, and flowers,
Frets iron and nibbles steel,
Toil hard stones to meal,
Exterminates king, collapse town,
And blows the mountains down.

Asked by Neha on 20 Mar 2023


People make me, save me, change me, raise me. What am I?

Asked by Neha on 08 Mar 2025

What is full of holes but still holds water?

Full of holes riddle

Asked by Neha on 26 Apr 2021

If you read clockwise, you can form a word by inserting three missing letters in the picture given below. Can you do it?

English Clockwise

Asked by Neha on 10 Sep 2023


The warden meets with 23 new prisoners when they arrive. He tells them, "You may meet today and plan a strategy. But after today, you will be in isolated cells and will have no communication with one another.

"In the prison is a switch room, which contains two light switches labeled 1 and 2, each of which can be in either up or the down position. I am not telling you their present positions. The switches are not connected to anything.

"After today, from time to time whenever I feel so inclined, I will select one prisoner at random and escort him to the switch room. This prisoner will select one of the two switches and reverse its position. He must flip one switch when he visits the switch room, and may only flip one of the switches. Then he'll be led back to his cell.

"No one else will be allowed to alter the switches until I lead the next prisoner into the switch room. I'm going to choose prisoners at random. I may choose the same guy three times in a row, or I may jump around and come back. I will not touch the switches, if I wanted you dead you would already be dead.

"Given enough time, everyone will eventually visit the switch room the same number of times as everyone else. At any time, anyone may declare to me, 'We have all visited the switch room.'

"If it is true, then you will all be set free. If it is false, and somebody has not yet visited the switch room, you will all die horribly. You will be carefully monitored, and any attempt to break any of these rules will result in instant death to all of you"

What is the strategy they come up with so that they can be free?

Asked by Neha on 10 May 2021

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?

Asked by Neha on 01 Jun 2024

The two towns are exactly 100 km apart. John leaves City A driving at 30 km/hr and Jacob leaves City B half an hour later driving at 60 km/hr. Who will be closer to City A when they meet?

Asked by Neha on 11 Nov 2024


John bought a new car. He has a habit of eating ice cream from a particular ice cream shop while returning home from office. Whenever, he eats strawberry ice cream, he faces no problem. But whenever, he eats chocolate ice cream, the car starts giving problem. At first, he thinks, it is just a co-incidence but when this awkward incident happens for 3-4 times, he reports this problem to the company.

The mechanic of the company checks but finds no problem at all. The next day, when he stops by to eat chocolate ice cream, the car again starts giving problem.

Can you find the possible reason?

Asked by Neha on 17 Sep 2024

Hot Articles

Amazing Facts

No Solution

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