You have 1023 apples and 10 bags. You have to distribute these apples in these 10 bags in any way you choose. But when I ask for a certain number of apples you have to give them in terms of bags without transferring the apples from other bags. How do you distribute the apples?

You know three triplets: Frank John and Wayne (need to return your money). Frank always tells the truth while John and Wayne always lie. You meet one of them on the road and can ask him a three-word question.
Which question, will you ask?

There is a shop where written:
Buy 1 for $1
10 for $2
100 for $3
I needed 999 and still only paid $3. How could this be financially viable for the shop-keeper?

Alex is stranded on an island covered in forest.
One day, when the wind is blowing from the west, lightning strikes the west end of the island and sets fire to the forest. The fire is very violent, burning everything in its path, and without intervention the fire will burn the whole island, killing the man in the process.

There are cliffs around the island, so he cannot jump off.

How can the Alex survive the fire? (There are no buckets or any other means to put out the fire)

One day, I thought of ways that can be used for creating a palindrome. So I decided that I will turn into a larger number by adding the reversed digits to the original number and keep doing it till I finally obtained a palindrome.

I am not sure if this process will always result in a palindrome eventually but I was able to produce a four-digit palindrome. Can you guess my starting number?

A few friends are enjoying their sea voyage in a boat full of apples. On the way, they felt hungry and thus decided to eat the apples. Together, they ate two dozen of apples. When they have eaten the apples, will there be any change in the water level?

In the following series, a set of numbers is progressing with a particular pattern. Can you deduce that pattern and find the missing set?

(2 + 6), (21 + 6), (58 + 6), (119 + 6), ___

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?

John has eleven friends. He has a bowl containing eleven apples. Now He wants to divide the eleven apples among his friends, in such a way that an apple should remain in his bowl.
How can He do it?

Six glasses are in a row. The first three are filled with milk and the last three are empty. By moving only one glass, can you arrange them so that the full and the empty glasses alternate?