Assume the given figure to be a delicious doughnut. Yes, now you can concentrate more on the puzzle. So you have this delicious doughnut in your refrigerator when your friends come knocking at the door. There are eight of them. Now you have to make three cuts in this doughnut so that each one of you nine people can enjoy a piece of it. Neither you nor your friends would mind the size of their piece as long as they are getting it. How will you do it?

One absent-minded ancient philosopher forgot to wind up his only clock in the house. He had no radio, TV, telephone, internet, or any other means for telling time. So he travelled on foot to his friend's place a few miles down the straight desert road. He stayed at his friend's house for the night and when he came back home, he knew how to set his clock. How did he know?

Can you find out the next digit in the following series ?

0, 0, 1, 3, 2, 6, 3, 9, 4, 12, 5, ?

What is the largest amount of money that you can possess in change and still if someone asks you for a dollar, you won't be able to give?

A few friends are enjoying their sea voyage in a boat full of apples. On the way, they felt hungry and thus decided to eat the apples. Together, they ate two dozen of apples. When they have eaten the apples, will there be any change in the water level?

A King wants to send the diamond ring to his girlfriend securely. He got multiple locks and their corresponding keys. His girlfriend does not have any keys to these locks and if he sends the key without a lock, the key can be copied in the way. How can King send the ring to his girlfriend securely?

An apple seller is hosting a competition. He offers 1000 apples and 10 boxes to the people who pass by. The challenge is to put those 1000 apples in the 10 boxes in such a manner that if he asks for any amount of apples, the person can directly give him the boxes or a combination of boxes. If the person can do it, he promises to give a thousand apples for free.

If you happen to pass by the apple seller, will you be able to win a thousand apples?

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?

Solve The below Equation:

ALFA + BETA + GAMA = DELTA

Replace the question mark with the correct number in the below-given picture?