A and B have a certain number of chocolates with them. If B gives one chocolate to A, they will have an equal number of chocolates. But if A gives one chocolate to B, then A will be left with half the number of chocolates that B has.

Can you find out the number of chocolates they have right now?

Find the Goldfish below the given Image.

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?

In particular commonwealth games, a female participant won silver and gold medals for a single event.

How can this be possible?

John and his team plan to rob a safe. They got just one chance to break the code else the local police will be informed. Below are clues:
A) Exactly one number is perfectly placed: 9 8 1
B) Everything is incorrect: 9 2 4
C) Two numbers are part of the code of the safe but are wrongly placed: 0 9 3
D) One number is part of the code of the safe but is wrongly placed: 1 4 7
E) One number is part of the code of the safe but is wrongly placed: 7 8 3

Quickly Solve this riddle

7 - 4 + 3 * 0 + 1 = ?

Kareena is older than Katrina and younger than Karishma. Isabelle is younger than Bipasha and Karishma. Bipasha is older than Karishma. If Kareena and Isabelle are the same age, who's the youngest?

I have an apple tree , number of apple in this tree get doubles every week.

On 30th week , the tree gets completely filled with apples :-)



Can you tell me , on what week does my tree is half covered with apples ?

In a basket of apples,
when counted in twos, there was one extra
when counted in threes, there were two extra when counted in fours, there were three extra
when counted in fives, there were four extra
when counted in sixes, there was five extra.

However, if the apples were counted in sevens, no extra apple was left. Can you calculate the minimum number of apples that were present in the basket?

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?