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.

My sock drawer has 26 blue socks, 13 pink socks, 33 green socks, and 12 red socks, how many socks would I have to pull out in the dark to be sure I had a matching pair?

How can you make the following equation true by drawing only one straight line: 5+5+5=550 ?

The Little ant seems to be always confused. Do you know why?

Can you name three consecutive days without using the words Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, or Sunday?

Cristina leaves home and then she makes exactly 3 left turns and returns home where she found 2 girls wearing the mask.

Who are these two masked girls?

The captain of a ship was telling this interesting story: "We travelled the sea far and wide. At one time, two of my sailors were standing on opposite sides of the ship. One was looking west and the other one east. And at the same time, they could see each other clearly." How can that be possible?

Can you find the least possible number such that

If the number is divided by 3, it gives the remainder of 1;
If the number is divided by 4, it gives the remainder of 2;
If the number is divided by 5, it gives the remainder of 3;
If the number is divided by 6, it gives the remainder of 4.

There is an exact a week gap between Christmas and New Year. Hence, It is obvious that the new year that comes right after Christmas comes on the same day of the week.

A Strange thing happened in the Year 1777. Christmas occurs on Wednesday and New Year on Monday. How is that possible?

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?