Three people check into a hotel. They pay $60 for the rent of the room. After they check-in, the manager realize that the rent for the room is $55. So, he gives $5 to the bellboy and asks him to give it to them. The bellboy thinks that it will be difficult for the three people to share $5 among them and seeking the personal benefit, he pockets $2 and gives the remaining $3 to them.

Now, each person paid $20 and got back $1. In this manner, each of them paid just $19 which totals to the amount of $57. The bellboy has $2 with him and adding them, we get $59. So where is the remaining $1?

You have two buckets of 11 liters and 6 litres.
How can you measure exactly 8 litres?

Write the next letter in this sequence.
O, T, T, F, F, S, S, E, __
**Hint: It is a Number Series Puzzle

Find the missing letter in the last circle logically in the given below picture.

There is a jar in which there are two types of candies.
20 blueberries and 16 strawberries. You perform the following steps:
1) You take out two candies.
2) If the two candies are of the same flavour, you add a blueberry one otherwise, you add the strawberry one.

You repeat these two steps till there is just one candy remaining in the jar. Which flavoured candy will be left?

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?

A man fell off a smuggling boat into deep water. He could not swim and he was not wearing anything to keep him afloat. It took 30 minutes for the people on the boat to realize someone was missing. The missing man was rescued two hours later on the return trip. Why didn't he drown? Note:- He didn't know swimming, the sea was deep, and He wasn't holding anything

The picture shows the dice results in each couple of throws. If they are actually following a pattern, can you find out the missing one?

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?

Replace the question mark with the number below given a simple math problem.