Vacation Days

Some friends went on a vacation to a resort. It was raining heavily and it kept raining for thirteen days.

When it rained in the morning, the afternoon was beautiful and when it rained in the afternoon, the day was blessed with a clear morning.

Overall, the friends experienced eleven nice mornings and twelve nice afternoons. Can you find out the number of days they spent on vacation?




Similar Logic Riddles

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 19 Oct 2024


A dying old man wants to divide his entire land between his only two sons. Since his only wish is to treat them as equal as both of them have been too good to him, he wants to divide his land equally between them. The problem is that the land is significantly irregular in shape and thus there is no choice of cutting them into two equal halves.

Can you help him divide the land in a manner that both of his sons will be happy?

Asked by Neha on 20 Jun 2023

A maths symbol is hidden in the below Bar Graph. Can you decipher it?

Maths Symbol Graph

Asked by Neha on 27 Mar 2021


Christina is practising her dance steps along with her friends. In a particular sequence, all of them form a row. At that point, Niharika is standing in the 4th position from either end of the row.
Can you find out how many girls are practising together?

Asked by Neha on 10 Oct 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

Out of three Friends John, Jacob and Jonny one of them is a king, one is a bureaucrat, and one is a Spy.

The king always tells the truth, the bureaucrat always lies, and the Spy can either lie or tell the truth.

John says: Jonny is a bureaucrat
Jacob says: John is a king
Jonny says: I am a Spy

Tell me, Who is the king, who is the bureaucrat, and who is the Spy?

Asked by Neha on 03 Feb 2024


Jim and Sarah are in a long-distance relationship. Jim buys an engagement ring for Sarah and wants to mail it to her. Unfortunately, the only way to ensure the ring will be received is to place a lock on the package. Jim has locks and Sarah has locks, but neither has keys for each other’s locks. How can they make sure the ring isn’t stolen?

Asked by Neha on 17 Jun 2025

10 people came into a hotel with 9 rooms and each guest wanted his own room. The bellboy solved this problem.
He asked the tenth guest to wait for a little with the first guest in room number 1. So in the first room, there were two people. The bellboy took the third guest to room number 2, the fourth to number 3, ..., and the ninth guest to room number 8. Then he returned to room number 1 and took the tenth guest to room number 9, still vacant.
How can everybody have his own room?

Asked by Neha on 21 Aug 2023

What does man love more than life, and hate more than death or mortal strife; that which satisfied men want; the poor have, and the rich require; the miser spends, the spendthrift saves, and all men carry to their graves?

Asked by Neha on 23 Jun 2025


Imagine a box with two cogwheels, one big with 24 teeth and one small with 8 teeth. The big one is firmly attached to the center of the box which means it does not turn or move while the small one rotates around the big one.

How many times do you think that the smaller wheel will turn compared to the box when it turns once around the big one?

Magical Wheels

Asked by Neha on 22 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