At a bar, three friends, Mr Green, Mr Red and Mr Blue, were having a drink. One man was wearing a red suit; one a green suit; and the other a blue suit. 'Have you noticed,' said the man in the blue suit, 'that although our suits have colours corresponding to our names, not one of us is wearing a suit that matches our own names?' Mr Red looked at the other two and said, 'You're absolutely correct. What colour suit is each man wearing?

Four cars come to a four-way stop, each coming from a different direction. They can’t decide who got there first, so they all go forward at the same time. All 4 cars go, but none crash into each other. How is this possible?

He loves to dance, twist and prance, he shakes his tail, and as a way he sails, wingless he flies into the sky. What is he?

What is the fastest way to double your money?

I am a word that begins with the letter “i.” If you add the letter “a” to me, I become a new word with a different meaning, but that sounds exactly the same. What word am I?

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?

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?

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?

What question can you never answer yes to?

What's the next in the series?

H, Be, F, S, Mn, Kr, In, Gd, Tl, ?