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?
Pronounced as one letter,
And written with three,
Two letters there are,
And two only in me.
I am double, I am single,
I am black blue and grey,
I am read from both ends,
And the same either way.
Six people park their car in an underground parking of a store. The store has six floors in all. Each one of them goes to a different floor. Simon stays in the lift for the longest. Sia gets out before Peter but after Tracy. The first one to get out is Harold. Debra leaves after Tracy who gets out on the third floor.
Can you find out who leaves the lift on which floor?
A spaceship was lost. The detective was given a piece of paper. This was the location of the spaceship! This is what the slip had scribbled on it:
Juice, Umbrella, Potato, Ice, Tomato, Elephant, Rice.
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?