You visit a home for specially-abled children on the occasion of Christmas where you meet with 50 children. You have a box of chocolates containing 50 chocolates exactly.

What if you were asked to one chocolate to each child in a manner that one chocolate still remains in the box? Is it possible?

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?

Can you decipher the below rebus?

PBLUESAISNUERSES

On a magical land of Mexico , all the animal in the land are rational.

There are 10 tigers and one goat.
Tiger can eat goat but since it's a magical land , the tiger who eats the goat , turns into goat and then can be eaten by the remaining tiger(s).

If we leave them for some time then how many goat and tiger will be there , when we come back ?

Can you find out what is missing?

1 3 5
2 4 ?

Hint: It's not six. Think out of the box.

What is the largest amount of money that you can possess in change and still if someone asks you for a dollar, you won't be able to give?

Steffi's daughter Jazelle needs to be picked up from school every day.
Steffi asks one of her colleagues to pick up Jazelle from the school. Steffi devised a password system to confirm that Jazelle goes with the correct colleague only.

The password on Monday was SJM16.
The password on Wednesday was TAW39.

What will the password be for Friday?

I am the fastest animal but cannot climb the tree. What am I?

I am Huge on Sunday and Saturday.
I am small from Tuesday to Thursday.
I do not exist on Monday and Friday.
Who am I?

In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?