A family is trapped in a jungle. There is a bridge which can lead them to safety. But at one time, the bridge can only allow two people to pass through. Also, all of them are afraid of the dark and thus, they can't go alone.

Father takes 1 minute to cross, the mother takes 2 minutes, the son takes 4 and the daughter takes 5 minutes. While crossing the time taken will be according to the slower one. How can they all reach the other side in the minimum possible time?

You are on your way to visit your Friend, who lives at the end of the hill. It is his birthday, and you want to give him the cakes you have made. Between your house and his house, you have to cross 5 bridges, and as it goes in the land of make believe, there is a troll under every bridge! Each troll, quite rightly, insists that you pay a troll toll. Before you can cross their bridge, you have to give them half of the cakes you are carrying, but as they are kind trolls, they each give you back a single cake. How many cakes do you have to leave home to make sure that you arrive at a friend's house with exactly two

I speak without a mouth, and hear without ears. I have no-body, but I come alive with the wind. What am I?

There are six people in a family namely M, N, O, P, Q and R.

R and O are brother and sister.

N is the brother of Q's husband.
P is the father of M and grandfather of R.

How many male members are in the family?

Jenifer and Jesica are having a conversation.

Jenifer: I am definitely not over 30.
Jesica: I am 28 and you are surely 5 years older to me at least.
Jenifer: No, you are at least 29.

You are told that both of them are lying throughout in the conversation. Can you find their respective ages?

What common phrase is represented by the below lines

Easy going:
Weak, 'I'm going.'
Tough, 'I'm staying.'

Medium going:
Weak, 'I'm going.'
Tough, 'I'm staying.'

Tough going:
Weak, 'I can't do it, I'm staying!'
Tough, 'Let's get going.'

What has hands, but can’t clap?

The warden meets with 23 new prisoners when they arrive. He tells them, "You may meet today and plan a strategy. But after today, you will be in isolated cells and will have no communication with one another.

"In the prison is a switch room, which contains two light switches labeled 1 and 2, each of which can be in either up or the down position. I am not telling you their present positions. The switches are not connected to anything.

"After today, from time to time whenever I feel so inclined, I will select one prisoner at random and escort him to the switch room. This prisoner will select one of the two switches and reverse its position. He must flip one switch when he visits the switch room, and may only flip one of the switches. Then he'll be led back to his cell.

"No one else will be allowed to alter the switches until I lead the next prisoner into the switch room. I'm going to choose prisoners at random. I may choose the same guy three times in a row, or I may jump around and come back. I will not touch the switches, if I wanted you dead you would already be dead.

"Given enough time, everyone will eventually visit the switch room the same number of times as everyone else. At any time, anyone may declare to me, 'We have all visited the switch room.'

"If it is true, then you will all be set free. If it is false, and somebody has not yet visited the switch room, you will all die horribly. You will be carefully monitored, and any attempt to break any of these rules will result in instant death to all of you"

What is the strategy they come up with so that they can be free?

Decode below three cipher riddles:

26 L of the A
7 D of the W
1000 Y in a M

In order to complete the racing competition, the Mexico racetrack has to submit its top and the most famous three horses to win the competition. Due to an electrical storm, all the records are cleared and no one knows which horse holds the record. They all look identical and it becomes even more difficult to differentiate the horses. There are 25 horses in the Mexico racetrack. But there can be only five horses at a time on the track. What will the least number of races that can be conducted to find out the three fastest horses?