Replace the question mark with the correct number below.

What does below pictogram mean?

You are given 16 witch hats. The hats are divided in four different colours – red, blue, green and yellow. Every colour has been assigned to four hats. Now each of the hat will be glued with a label of an arithmetic sign – ‘+’, ‘-‘, ‘x’ or ‘/’. But you can label one sign only once on one colour. In such an arrangement, the hats can be uniquely defined by its colour and symbol.

Can you arrange all the 16 hats in a 4x4 grid in a fashion that no two rows and columns have a repetition of colour or sign?
We have arranged four hats in the below picture to assist you.

It is a 5 letter word if you take away first letter it is something you get from sun, if you remove second letter you will get something to eat, if you remove third letter you get a word you use in pointing at and if you remove the fourth letter you get something to drink. What is it?

There are 2 cops parked along a one-way street looking for traffic violations. They spot a taxi driver going in the wrong direction, yet they do nothing.

Why?

Can anyone tell me a word in the English dictionary which has a silent 'z'?

You have two jars of chocolates labelled as P and Q. If you move one chocolate from P to Q, the number of chocolates on B will become twice the number of chocolates in A. If you move one chocolate from Q to P, the number of chocolates in both the jars will become equal.

Can you find out how many chocolates are there in P and Q respectively?

Looking at the figure given, you will find a square formed with match sticks. This figure comprises five squares. Can you move the matchsticks such that the resulting figure consists of ten squares? Please note that you can drag the matchsticks can't rotate them and have just four moves. How will you do it?

Double it and multiply it by 4. Then divide it by 8 and you’ll have it once more. What number is it?

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?