Youngest Person

Christina is older than Kareena and Karishma. Katrina is older than Karishma and younger than Kareena. If Kareena has a brother named John, who is older than Christina, who's the youngest?




Similar Logic Riddles

The captain of a ship is telling you an interesting story and then poses a question. He says, “I have travelled the oceans far and wide. One time, two of my sailors were standing on opposite sides of the ship. One was looking west and the other one east. And at the same time, they could see each other clearly. Can you tell me how that was possible?”

Asked by Neha on 11 Jun 2025


There are people and strange monkeys on this island, and you can not tell who is who (Edit: until you understand what they said - see below). They speak either only the truth or only lies.
Who are the following two guys?
A: B is a lying monkey. I am human.
B: A is telling the truth.

Asked by Neha on 16 Jun 2023

Rob is taller than Edwin, and Jurgen is shorter than Rob.
Of only one of the following statements, we now certainly know it is correct:

A.Edwin is taller than Jurgen
B.Jurgen is taller than Edwin
C.It cannot be determined if Jurgen or Edwin is the tallest.

Asked by Neha on 01 Mar 2024


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

Replace the letters of words with a number so that the below equation holds true

BASE +
BALL
---------
GAMES
----------

Asked by Neha on 10 Oct 2023

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?

Asked by Neha on 18 Oct 2024


Two batsman each on 94 runs. Seven runs needed to win in last 3 balls. Both make 100*. How?

Asked by Neha on 05 Feb 2023

You have a thousand Re. 1 coins with you. You have ten bags with you and you can put any number of coins in each of the bags. The condition is that if someone asks you for any amount between 1 and 1000, you must be able to give that amount by just giving the bag (you are not allowed to open the bag and give coins).

How will you do it?

Asked by Neha on 12 May 2024

I have 50 feet long of cloth, I need to create 50 handkerchiefs each size of 1 foot. I take one minute to cut a 1-foot handkerchief. So how long will it take to cut 50 handkerchiefs?

Asked by Neha on 05 Sep 2024


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?

Nodes Connectivity Riddle

Asked by Neha on 20 Dec 2020

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