A Car driver was heading down a street in Washington. He went right past a stop sign without stopping, he turned left where there was a 'no left turn' sign and he went the wrong way on a one-way street. Then he went on the right side of the road past a cop car. Still, he didn't break any traffic laws. Why not?

Things are just as they seem, right? Well, check again.
Can you count the number of tigers in this picture ?

Can you identify the Oscar-winning movie from the rebus below?

Before the start of the car race, John and Jacob have the same amount of fuel in their car. With this fuel, John can drive for 4 hours while Jacob can drive five hours.
After a time they realize that the amount of fuel left in John's car is 1/4th of the fuel in Jacob's.

For how long they are racing?

Three friends named Mr. Black, Mr. Yellow and Mr. Green enter a pub on a weekend night. They are wearing either a Black, Yellow or Green shirt.

Mr. Yellow says to them, 'Did you notice that we all are wearing different color shirts than our names?'

To this, the man who was wearing the Green shirt said. 'Wow, thats right.'

Can you identify who is wearing which colour shirt ?

Which is Odd One Out and why?

4377

3954

9862

8454

9831

It is a six-letter word.
The first four letters are me.
The second and last letters are the same.
The fourth second and last letter is payment.

Who is it?

What is the Surname of Barbie Doll?

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?

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?