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?

Mother's Name is Mrs. SIXTY TWO
Son's Name is FIFTY TWO
Daughter's Name is FORTY TWO
What is Name of Father?

What does the following BrainBat signifies?

ABCDEFGHIJKLMNOPQRSTUVWYZ

QQQQQQQQQQQQQQQQQQQQQQQQQ.

How can you make a TV, a bed, a dog, and a car liquid?

A car is crossing a 20 km-long bridge. The bridge can support at most 1500kg of weight over it. If somehow, the weight on the bridge becomes more than that, it will break.

Now, the weight of the car is exactly 1500kg. At the midway, a bird comes and sits on the roof of the car. This bird weighs exactly 200 grams.
Can you tell if the bridge breaks at this point or not?

Make the seating arrangement of 10 children in such a way that there are 5 rows with 4 children in each row.

I am a type of room you cannot enter or leave. Raised from the ground below, I could be poisonous or a delicious treat. What am I?

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?

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?

Place the numbers from 1 to 9 in the circles in a manner that each side of the triangle sums up to 17.