Usage of Elevator Riddle

A man lives on the fifteenth floor of an apartment building. Every morning he takes the elevator down to the lobby and leaves the building. In the evening, he gets into the elevator, and, if there is someone else in the elevator, or if it was raining that day, he goes back to his floor directly. Otherwise, he goes to the tenth floor and walks up five flights of stairs to his apartment. Can you explain why he does this?




Similar Logic Riddles

What number does the below three word/phrase identify and why?
1. Deck
2. Year
3. Singing in the Rain

Asked by Neha on 21 Feb 2024


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

A train full of passengers goes through a tunnel. When the train comes out from the other end, there is no single person on the train.

How did it happen?

Asked by Neha on 26 Dec 2025


If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.

Asked by Neha on 29 Oct 2023

What numbers should go on the bottom line?
3 6 9 15
8 2 10 12
11 8 19 27
19 10 29 39
? ? ? ?

Asked by Neha on 29 Apr 2022

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


You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?

Asked by Neha on 23 Apr 2022

John bought 150 chocolates but he misplaced some of them. His Father asked him how many chocolates were misplaced.
He gave the following answer to him:
If you count in pairs, one remains
If you count in threes, two remain
If you count in fours, three remain
If you count in fives, four remain
If you count in sixes, five remain
If you count in sevens, no chocolate remains.

Can you analyze the statements and tell us how many chocolates were lost?

Asked by Neha on 22 Dec 2024

4 fathers, 2 grand-fathers and 4 sons went to watch the movie.What is the minimum number of tickets they need to buy ?

Asked by Neha on 04 Jan 2024


A Japanese ship was en route to a mission on foreign seas. The captain of the ship felt tired and thought of taking a bath. He went for taking the shower and removed his diamond ring and Rolex and kept them on the table. When he returned after taking the bath, he found that the ring and watch were stolen.

He called the five members of the crew whom he suspected and asked them what they were doing for the last 15 minutes.

The Italian cook (with a butcher knife in hand): I was in the fridge room getting meat for cooking.

The British Engineer (with a high beam torch in hand): I was working on a generator engine.

The Pakistani seaman: I was on the mast correcting the flag which was upside down by mistake.

The Indian Radio officer: I was trying to make a contact with the company to inform them about our position.

The American navigation officer: I am on night watch, so I was sleeping in my cabin.

Upon listening to them, the captain caught the lying member. Who do you think stole the valuables?

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