Three people enter a room and have a green or blue hat placed on their heads. They cannot see their own hat but can see the other hats.
The colour of each hat is purely random. They could all be green, blue, or any combination of green and blue.
They need to guess their own hat colour by writing it on a piece of paper, or they can write 'pass'.
They cannot communicate with each other in any way once the game starts. But they can have a strategy meeting before the game.
If at least one of them guesses correctly they win $10,000 each, but if anyone guesses incorrectly they all get nothing.
What is the best strategy?

In the four images below, can you find the odd one out?

It's a protector.
It sits on a bridge.
One individual can see directly through it, while others wonder what it hides.

What is it?

I am sometimes honest
Sometimes dishonest
I can be sweet and also bitter
I can hurt you real bad and
also make u smile and blush ☺️
What am I?

If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.

A thief enters a store and threatens the clerk, forcing her to open the safe. The clerk says, “The code for the safe is different every day, and if you hurt me you’ll never get the code.” But the thief manages to guess the code on his own. How did he do it?

The following alphametic has only one solution. Can you find it?
ENLIST + SILENT + LISTEN = ANAGRAM

PS: You may start the number from 0.

You and your two friends are working in a multinational company. How can you three find out the average salary of you all without disclosing your own salary to the other two?

Can you spot the man between the coffee bean in the picture below ?

What can jump higher than a building?