Help to Cross the Bridge

A bridge is about to collapse. There are four people P, Q, R and S on one of the sides. Before the bridge collapses, they want to cross it. Now since the bridge is too weak, it can only stand the weight of two people at a time. Also, it is night time and nothing is visible. They have just one torch with them.

Now P takes one minute to cross the bridge, Q takes two minutes to cross, R takes five minutes to cross and S takes ten minutes to cross.

The bridge will collapse in seventeen minutes. How will they be able to cross the bridge before it collapses?




Similar Logic Riddles

Why did Buffon take the goal with him after every Juventus match?

Asked by Neha on 24 Apr 2025


On a windy rainy night , I was driving in my car.
When i reach the bus stand , i see three people waiting for the bus.

1. An old lady who needs an immediate medical attention
2. My Best Friend
3. Girl whom i love from childhood

My car is a two seat, so can you tell me , what i have done in this situation ?

Asked by Neha on 14 Feb 2023

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


You are provided with a grid (as shown in the picture). Can you fill the squares with numbers 1-8 in a manner that none of the two consecutive numbers are placed next to each other in any direction (vertically, horizontally or diagonally?)

Fill The Grid

Asked by Neha on 22 Sep 2025

John and Jacob are twin brothers. One of them is a liar whereas the other one is a truth-teller.

I called their home number and one of them picked up.
I asked. 'Does John lie?' The person replied with a yes.

Whom did I talk with, John or Jacob?

Asked by Neha on 23 Nov 2024

Four people need to cross a rickety bridge at night. Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge. Times for each person: 1 min, 2 mins, 7 mins and 10 mins. What is the shortest time needed for all four of them to cross the bridge?

Asked by Neha on 24 Aug 2023


A pet show was happening in my locality. I went down along with my kids. In that show, I noticed that all except two of the entries were cats. All except two were dogs and all except two were Monkeys.

Can you find out how many of each animals were present in that pet show?

Asked by Neha on 04 Feb 2021

John speaks the truth only once a day in a week. Below are a few hints for you:

First: Days are Sunday, Monday and so on.
Second: One day he says, "I lie on Monday and Tuesday".
Third: On the next day, he says, "Today is either Thursday, Saturday or Sunday".
Fourth: On the next day, he says, "I lie on Wednesday and Friday".

Can you identify the day on which he speaks the truth?

Asked by Neha on 09 May 2025

In a guessing game, five friends had to guess the exact numbers of apples in a covered basket.
Friends guessed 22, 24, 29, 33, and 38, but none of the guesses was correct. The guesses were off by 1, 8, 6, 3, and 8 (in random order).

Can you determine the number of apples in a basket from this information?

Asked by Neha on 23 Mar 2024


There are three boxes which are labeled as Rs100, Rs150, and Rs200. One box contains two notes of Rs. 50. The second box contains one note of Rs50 and one note of Rs100 The third box contains two Rs. 100 notes. All boxes are labeled incorrectly.

What is the minimum number of boxes you must check in order to label all boxes correctly?

Asked by Neha on 02 Feb 2021

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.