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?

John is on an island and there are three crates of fruit that have washed up in front of him. One crate contains only apples. One crate contains only oranges. The other crate contains both apples and oranges.

Each crate is labelled. One reads 'apples', one reads 'oranges', and one reads 'apples and oranges'. He know that NONE of the crates have been labeled correctly - they are all wrong.

If he can only take out and look at just one of the pieces of fruit from just one of the crates, how can he label all of the crates correctly?

Find the hidden panda in the image below.

I look at you, you look at me, I raise my right, you raise your left. What am I?

A person was found dead on a big green land with no trees or buildings around. When the police arrived, they found a piece of rock lying next to him and the man was wearing clothes comprising of red, blue and yellow colours.

Can you tell who the person is and what was the cause of death?

I know there are two methods by using three time the same number with a plus(+) operator , you can make sum as 60.

One of them is 20+20+20.

whats the other way ?

He does not have any heart but still, He manages to live.
If you kill him, you will eventually die but yet you kill him.
He cannot run, who is He?

You can see it everyday, But cannot touch it at will. What is it?

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?