John is selling fruits.
He sells grapes at $30, Dates $25, and a Wolfberry $45.
At what price does he sell fig?

PS: Logical Thinking

A charming young lady was approached by a kind looking old woman in a restaurant. The old woman said to her, 'You look exactly like my younger daughter. Sadly she passed away a couple of months back. Could you do me a favor and say 'Goodbye, mother' with a kind smile on your face when I leave?

The young lady agreed for the same and said, 'Goodbye, mother' when the old woman left. Soon after, she got the most disengaging shock of her life.

Can you guess what the shock was?

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

If I put in one bird per cage, I have one bird too many. If I put in two bird per cage, I have one cage too many. How many cages and birds do I have?

John speaks the truth only once a day in a week. Below are a few hints for you:

First: Days are Sunday, Monday and so on.
Second: One day he says, "I lie on Monday and Tuesday".
Third: On the next day, he says, "Today is either Thursday, Saturday or Sunday".
Fourth: On the next day, he says, "I lie on Wednesday and Friday".

Can you identify the day on which he speaks the truth?

The two towns are exactly 100 km apart. John leaves City A driving at 30 km/hr and Jacob leaves City B half an hour later driving at 60 km/hr. Who will be closer to City A when they meet?

What does this say?

XLR8

Can you make four (4) nines (9) equal 100?

In order to complete the racing competition, the Mexico racetrack has to submit its top and the most famous three horses to win the competition. Due to an electrical storm, all the records are cleared and no one knows which horse holds the record. They all look identical and it becomes even more difficult to differentiate the horses. There are 25 horses in the Mexico racetrack. But there can be only five horses at a time on the track. What will the least number of races that can be conducted to find out the three fastest horses?

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?