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?

There are two candles. Both will only burn exactly for an hour. How will you use these two candles to measure forty-five minutes?

What building has the most stories?

How many times can you subtract the number 5 from 25?

While sitting in the Car, John suddenly finds that one of the wheels was missing. John noticed that a killer is approaching towards him. John cannot get out of the car.

How will John escape?

A man is surviving on an island along with his friend. They have been starving for four days for food. Suddenly, they find a fisherman. The friend goes with the fisherman in order to catch the fish (if they can find any).

The fisherman returns after some time but he is alone and has some salmon that he had prepared. When asked, the fisherman tells him that his best friend fell off the boat and drowned in the water. Starving for so long, he eats the meal while crying for his friend.

After being rescued, he goes to a diner and orders salmon. When he eats his meal, he jumps and commits suicide. Why did he do it?

I have branches, but no fruit, trunk or leaves. What am I?

Which Burger Is Different in below image?

Lady Gaga is pregnant and currently has 6 daughters

1. Dorry 2. Rebeka 3. Michael 4. Faniya 5. Sophia 6. Lavanya

What will she name her next child girl? (Think Logical)

A. Neema B. Tanya C. Tisha D. Jenniffer

100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?