John needs to purchase 100 chocolates from three different shops and he has exactly 100 rupees to do that which he must spend entirely. He must buy at least 1 Chocolate from each shop.

The first shop is selling each chocolate at 5 paise, the second is selling at 1 rupee and the third is selling at 5 rupees.

How many chocolates should he buy from each shop?

I purchased an awesome ice cream cone having 5 different flavour scoops.
Five flavours are pistachio, mint-chip, strawberry, marshmallow, and raspberry

I will give u some clues so that you can figure out the order of flavours from bottom to top.
1. The bottom flavour of the cone has 10 letters.
2. The marshmallow scoop is between the pistachio and the mint-chip scoop.
3. marshmallow is the raspberry scoop but below the mint-chip scoop.

So can you figure out the flavour of ice cream in order from bottom to top?

There is a place where if I stand up straight, I will still be considered sideways.

What does the following represent?

N N N N N N N

A A A A A A A

C C C C C C C

In the attached figure, you can see a chessboard and two rooks placed on the chess board. What you have to find is the number of squares that do not contain the rooks. How many are there?

There are 2 people near the river and both of them want to get on the other side. The boat can only take one of them. But they got across.
How?

If "P" means "-", "Q" means "/", "R" means "+", and "S" means "*" then find the value of the following:

21 Q 7 R 9 S 10 P 13

What famous saying does this rebus mean?

COME SERVED <---
COME SERVED
COME SERVED
COME SERVED
COME SERVED

Four cars come to a four-way stop, each coming from a different direction. They can’t decide who got there first, so they all go forward at the same time. All 4 cars go, but none crash into each other. How is this possible?

100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?