John is on an island and there are three crates of fruit that have washed up in front of him. One crate contains only apples. One crate contains only oranges. The other crate contains both apples and oranges.

Each crate is labelled. One reads 'apples', one reads 'oranges', and one reads 'apples and oranges'. He know that NONE of the crates have been labeled correctly - they are all wrong.

If he can only take out and look at just one of the pieces of fruit from just one of the crates, how can he label all of the crates correctly?

What Time Should the last watch show in the below figure?

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?

In a fruit store, there was a unique weighing machine that was made to weigh only cherries and strawberries as they were priced the same.

Other fruits like watermelons or mango had different machines as they were expensive.

A man successfully buys watermelons at the price of cherries. How?

There are people and strange monkeys on this island, and you can not tell who is who (Edit: until you understand what they said - see below). They speak either only the truth or only lies.
Who are the following two guys?
A: B is a lying monkey. I am human.
B: A is telling the truth.

Find the Next Number in the Sequence

2 9 3 1 8 4 3 6 5 7 ?

You stand in front of two doors. A guard stands next to each door. You know the following things: one path leads to paradise, the other leads to death. You cannot distinguish between the two doors. You also know that one of the two guards always tells the truth and the other always lies. You have permission to ask one guard one question to discover which door leads to paradise. What one question would you ask to guarantee you enter the door to paradise?

In a boat, the father of a sailor's son is sitting with the son of the sailor. However, the sailor is not present on the boat.

Can this even be possible?

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?

Find the next number in the sequence

5 12 24 36 ?