Make eight squares by moving only two matchsticks.
Note- Square can be of different sizes.

Can you discover the missing number in this series?

37, 10, 82
29, 11, 47
96, 15, 87
42, ?, 15

Decode below three cipher riddles:

26 L of the A
7 D of the W
1000 Y in a M

Four people need to cross a rickety bridge at night. Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge. Times for each person: 1 min, 2 mins, 7 mins and 10 mins. What is the shortest time needed for all four of them to cross the bridge?

What has to be broken before you can use it?

How many pluses should we put between the digits of 987654321 to get a total of 99, and where?

To tease, King Akbar told his most clever advisor Birbal to give his daughter one thing that she can eat when hungry, drink if she feels thirsty and can burn if she feels cold. King Akbar was shocked when Birbal gave Akbar's daughter one such thing that satisfies all of the above.

What did Birbal give to Akbar's daughter?

If a zookeeper had 100 pairs of animals in her zoo, and two pairs of babies are born for each one of the original animals, then (sadly) 23 animals don’t survive, how many animals do you have left in total?

Mr. Buttons was all set to go to the village of Buttonland to meet his friend. So, he packed his bags and left for the village at 5 in the morning. Upon travelling on a road for miles, he came across a point where the road diverged into two. He was confused on which road to take. He gazed around and he saw two owls sitting on a branch. He thought he could ask for directions for the village from the two owls. So he went to the tree. There he saw a sign which read, "One owl always lies, and one is always truthful. They both fly away if you ask them more than 1 question."
Mr. Buttons was caught in the dilemma of what to ask? And from which owl to ask, since he only had one question. What should Mr. Buttons ask?

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?