A country that gets ill every time

Which country gets ill every time?




Similar Riddles

Mr. Buttons was all set to go to the village of Buttonland to meet his friend. So, he packed his bags and left for the village at 5 in the morning. Upon travelling on a road for miles, he came across a point where the road diverged into two. He was confused on which road to take. He gazed around and he saw two owls sitting on a branch. He thought he could ask for directions for the village from the two owls. So he went to the tree. There he saw a sign which read, "One owl always lies, and one is always truthful. They both fly away if you ask them more than 1 question."
Mr. Buttons was caught in the dilemma of what to ask? And from which owl to ask, since he only had one question. What should Mr. Buttons ask?

Asked by Neha on 18 Aug 2021


I’m light as a feather, yet the strongest person can’t hold me for five minutes. What am I?

Asked by Neha on 15 Feb 2022

O_er_t_o_

Complete the missing letters of the given word.

Asked by Neha on 22 Feb 2022


There are four people in a house. A fireman, an athlete, an old woman, and a drunk guy. The house catches fire and before the fact is known, it is too late. All they know is that the entire house is in flames and it will collapse exactly after twelve minutes. Now they can move out of the house but for that, they will have to pass the hallway which is entirely blazing with flames. Thus to move, one must carry a fire extinguisher to keep the flames away. Seeking the burnt wooden floor, only two people can run through that hallway at one time. But for others to go, one must return back with the fire extinguisher. The fireman is trained for such tasks and can run through the hallway in a minute. The athlete can make it in a couple of minutes. The old woman can run slowly and will cover the hallway in four minutes. The drunk guy will take five minutes to run through it. If all of them can make it through the hallway in twelve minutes, all of them will be saved. When two move together, they will run at the speed of the slower ones.

How will all four of them manage to run to safety?

Asked by Neha on 02 Jun 2023

A Club organizes a Running Race, and John, Jacob, Minda, and Tony participated.

The results are as follows

John beats Jacob
Minda beats Toni
Toni beats John

Who came first in the race?

Asked by Neha on 23 May 2024

What makes this number unique: 8,549,176,320?

Asked by Neha on 08 Jul 2025


One day, all the courtiers from Akbar's court were gathered in the assembly hall when one of them told the Emperor that all his valuables had been stolen by a thief the previous night.
This shocked the Emperor to his core as the place where that courter stayed was the most secured in the kingdom. The Emperor thought that it is not at all possible for an outsider to enter into the courtier's house and steal the valuables. Only another courtier could commit this crime. He quickly called Birbal to identify the thief.
Birbal thought for a while and successfully solved the mystery by identifying the thief in just one statement.
What did Birbal say?

Asked by Neha on 17 May 2021

There are three light switches outside a room. One of the switches is connected to a light bulb inside the room.
Each of the three switches can be either 'ON' or 'OFF'.

You are allowed to set each switch the way you want it and then enter the room(note: you can enter the room only once)

Your task is to then determine which switch controls the bulb?

Asked by Neha on 07 Mar 2023

If 21x = 79x, what is the value of x?

Asked by Neha on 19 Oct 2023


There are four 3-link chains. All you have to do is join them into a big 12-link chain. For joining two closed links, one of the links must be cut and placed onto the other link for closing.

How many minimum links will you have to cut to make the big chain?

Asked by Neha on 27 Sep 2023

Hot Articles

Amazing Facts

Artificial Intelligence

Artificial Intelligence has crushed all human records in the puzzle game “2048,” achieving a high score of 839,732 and beating the game in only 973 moves without using any undo.