Explanation:
There can be only two cases. Either Zoe is a liar or Joe is a liar.

First Case
Let us assume that Zoe is a liar and Joe is a truthful person.
If I asked the question from Joe, the answer will be yes. If I asked the question from Zoe, the answer will be no. Thus in this case, I must have asked from Joe.

Second Case
Let us assume that Zoe is a truthful and Joe is a liar.
If I asked the question from Joe, the answer will be yes. If I asked the question from Zoe, the answer will be no. Thus in this case as well, I must have asked from Joe only.

In a guess game , five friends had to guess the exact numbers of balls in a box.
Friends guessed as 31 , 35, 39 , 49 , 37, but none of guess was right.The guesses were off by 1, 9, 5, 3, and 9 (in a random order).
Can you determine the number of balls in a box ?

The three errors are as follows:
a) fynd is spelled wrong. The correct spelling is 'find'.
b) that is not appropriate to use here. It should be 'this'.
c) There are only two errors in the question and that is the third error because the questions asks us to find three.

The toothpicks in the picture have been arranged to form a donkey shaped figure. You have to move two matchsticks in a way that the entire shape is rotated / reflected while being intact. Also, you can't change the tail's direction it should be pointing up.

There are 100 doors. 100 strangers have been gathered in the adjacent room. The first one goes and opens every door. The second one goes and shuts down all the even numbered doors – second, fourth, sixth... and so on. The third one goes and reverses the current position of every third door (third, sixth, ninth… and so on.) i.e. if the door is open, he shuts it and if the door is shut, he switches opens it. All the 100 strangers progresses in the similar fashion.

After the last person has done what he wanted, which doors will be left open and which ones will be shut at the end?

Think deeply about the door number 56, people will visit it for every divisor it has. So 56 has 1 & 56, 2 & 28, 4 & 14, 7 & 8. So on pass 1, the 1st person will open the door; pass 2, 2nd one will close it; pass 4, open; pass 7, close; pass 8, open; pass 14, close; pass 28, open; pass 56, close.
Thus we can say that the door will just end up back in its original state for each pair of divisor. But what about the cases in which the pair of divisor has analogous number for example door number 16? 16 has the divisors 1 & 16, 2 & 8, 4&4. But 4 is recurrent because 16 is a perfect square, so you will only visit door number 16, on pass 1, 2, 4, 8 and 16… leaving it open at the end. So only perfect square doors will remain open at the end.

In a recreational activity, you are given four different jars of 2 liters, 4 liters, 6 liters and 8 liters respectively with an unlimited water supply. Then you are asked to measure exactly 5 liters of water using them.

Akbar summoned Birbal out of anger. He told him that he will have to face death. He asked him to make a statement and if the statement is true he will be buried alive and if the statement is false, he will be thrown at lions. After hearing Birbal’s statement, Akbar could do nothing but smile. He gave him 5 gold bars and let him go.

I will be thrown at lions. Now if Akbar threw him at lions, Birbal’s statement will stand true and he will have to bury him alive. But if he bury him, the statement will emerge as false. Thus he had no choice left