Solution:

From left to right
#1 Mr. Reed Richard – Blue Marbles
#2 Ms. Sue Storm – Red Marbles
#3 Mr. Johnny Storm – White Marbles
#4 Mr. Ben Grimm – Green Marbles.

Let us label the houses from left to right as #1, #2, #3, #4. Now let us split the hints in different category.
a) Mr. Reed Richard’s house is to the left of the green marbles one
b) The third one is made of white marbles
c) Ms. Sue Storm owns a red marbles house
d) Mr. Johnny Storm does not live on either ends
e) Mr. Johnny Storm lives right of the blue marbles house
f) Mr. Ben Grimm lives in the fourth house
g) The first house is not made up of red marbles

By seeking all the (g) and (b), we are sure that the #1 is not made up of red marbles and nor is the #3. Now with (f) we know that Mr. Ben Grimm lives in #4 made up of green marbles and keeping in mind (c) #2 must be made of Red Marbles and Ms. Sue Storm lives there. Now moving to the hint (d) Mr. Johnny Storm must be living in #3 and adding up with hint (b), it must be made from white marbles. Now by hint (a) #4 must be made up of green marbles (or Mr. Reed Richard’s house can’t be on its left). Also by (f) Mr. Ben Grimm lives there. All of it leaves Mr. Reed Richards living in #1 with blue marbles construction.

Solution:

Yes, you should switch the envelope. In the beginning when you picked up the envelope, you had a 1/3 probability of finding an offer letter in the envelope. There was 2/3 chance that the letter was there in the two envelopes on the table.

If you keep your selected envelope, you still have a 1/3 chance of finding an offer letter in that. However, since the interviewer has removed one empty envelope from the table, if you switch, you have a probability of 2/3 that the offer letter is inside that.

Solution:

NONE, holes are empty.

Solution:

The stranger said that he thought the room was his. If so, he must have had the keys to the room and thus he must not have knocked.

Solution:

Steps:
1) Light fire on first bar from both the ends and second bar from one end.

2) After 30 seconds(when first bar gets completely burned out) , burn the second bar from second end as well.

3) When second run completely gets burned , you know its 45 seconds.

Solution:

It can surely be true because it is not mentioned that it was raining.

Solution:

The Stars

Solution:

It can be solve as shown below.

Solution:

Let m be initial number of flowers and n be the flowers offered at each temple by the man.
Initial flowers = m
After stepping into the first temple = 2m
Flowers offered at the first temple = n
Remaining flowers = 2m – n

After stepping into the second temple = 4m – 2n
Flowers offered at the second temple = n
Remaining flowers = 2m – n

After stepping into the third temple = 8m – 6n
Flowers offered at the third temple = n
Remaining flowers = 8m – 7n

Now as per the question (8m – 7n) must be equal to 0.
i.e. 8m – 7 n = 0
or 8m = 7y

Now the least numbers required to solve this equation are 7 and 8 for m and n respectively.

Thus m = 7; n = 8
Which means, the man had 7 flowers in the beginning and he offered 8 flowers at each temple.

Solution:

25 Fruits

Remember we told you that Birbal is a witty trader. So his sole motive is to get rid of the sacks as fast as he can.

For the first sack:
He must be able to fill fruits from one sack to other two sacks. Assume that he is able to do that after M check points. Now to find M,

(Space in first sack) M + (Space in second sack) M = (Remaining fruits in Third Sack) 30 – M
M = 10

Thus after 10 checkpoints, Birbal will be left with only 2 sacks containing 30 fruits each.

Now he must get rid of the second sack.
For that, he must fill the fruits from second sack to the first sack. Assume that he manages to do that after N checkpoints.

(Space in First Sack) N = (Remaining fruits in second sack) 30 – N
N = 15

Thus after he has crossed 25 checkpoints, he will be left be one sack with 30 fruits in it. He has to pass five more checkpoints where he will have to give five fruits and he will be left with twenty five fruits once he has crossed all thirty check points.

Solution:

Never

Explanation:
In the question, the distance of x miles is given at a particular moment. The middle car is running at that time at 50 MPH. The distance will keep increasing with time as three are running at different speeds. It will increase by x miles every hour till a certain point of time and then it will start decreasing till the fastest car meets the slowest again.

As per question, all the cars stop then. Thus, the distance will never be x miles again.