A Club organizes a Running Race, and John, Jacob, Minda, and Tony participated.

The results are as follows

John beats Jacob
Minda beats Toni
Toni beats John

Who came first in the race?

On a certain day, John celebrated his birthday. Two days later, his older twin brother Jacob celebrated his birthday.

Is this even possible? How can it be?

A time long back, there lived a king who ruled the great kingdom of Trojan House. As a part of the renovation of the kingdom to meet future security needs, he asked his chief architect to lay down a new play in a manner that all of his 10 castles are connected through five straight walls and each wall must connect four castles together. He also asked the architect that at least one of his castles should be protected with walls. The architect could not come up with any solution that served all of King's choices, but he suggested the best plan that you can see in the picture below. Can you find a better solution to serve the king's demand?

A Child was born in Lahore, Pakistan. Still, the child is not a Pakistani citizen. why?

You walk into a creepy house by yourself. There is no electricity, plumbing, or ventilation. Inside you notice 3 doors with numbers on them. Once you open the doors you will die a particular way. Door No.1 You’ll be eaten by a lion who is hungry. Door No.2 You’ll be stabbed to death. Door No.3 There is an electric chair waiting for you. Which door do you pick?

At my favorite fruit stand,
an orange costs 18,
a pineapple costs 27,
and a grape costs 15.
Using the same logic, can you tell how much a mango costs?

Which word is least like the others? Third, fourth, fifth, sixth, seventh, eighth, ninth?

Katniss and Peeta are liars. They both lie on some specific days.

Katniss lies on Fridays, Saturdays and Sundays. She speaks the truth on all other days.

Peeta lies on Tuesdays, Wednesdays and Thursdays. He speaks the truth on all other days.

Can you tell that one day of the week when both of them will say "Tomorrow, I will lie."?

What is the fewest number of coins that would be required in order to make sure each and every coin touches exactly three other coins?

In the figure that has been attached to this question, each digit represents a digit. The similar letters carry the same integer value. Can you expose the original digits?