Solution:

Watermelon

Explanation:
- Something their friend Howard can eat: watermelon
- Something their neighbor penny can drink: juice of watermelon
- Something their friend Raj's cow can eat: Watermelon rinds
- Something his girlfriend Amy can plant in her garden: the seeds of a watermelon

Solution:

The brain teaser can be solved as shown in the image below.

Solution:

She is near the trunk of the tree as shown below.

Solution:

The figure tells that B is located to the North-East of E.

Solution:

There is a simple logic to solve this question.
The size of the chocolate is 2 x 8. Thus, you need to have 2 x 8 = 16 pieces.
Every time you break the chocolate, you will get one extra piece.
Thus, to get 16 pieces, you must break it (16 - 1) = 15 times.

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:

1653

Explanation:
For an ideal case, the batsman will hit a six on each ball. But if he hits six on the last ball of the over, the strike will change in the next over. Thus, the best he can do in the last ball is run 3 runs so that he retains the strike even in the next over. Thus the total runs that he can score in each over:
6 * 5 + 3 = 33
But this will have to go like it only till the 49th over. In the last over, he can hit a six in the last ball as well as that will be the last ball of the match.
Thus runs for the last over will be 6 * 6 = 36.
Hence the maximum runs = 33 * 49 + 36 = 1653

Solution:

7, 4, 6, 5, 8

Solution:

None

The sum of numbers from 0-9(0,1,2,3,4,5,6,7,8,9) is 45 and therefore can be divisible by 3 and 9.

Solution:

A Spider

Solution:

The code word is TIE.

Let us assume that the word is MOD. Now if you are told one character of this word, you would not be able to identify the number of vowels in the word. For example if you are told M, then the word can be MOD or AIM but they both have different number of vowels. If you are told about O, then there are two words MOD and OAT which again have different number of vowels. If you are told about D, there are two words again MOD and DUE which have different numbers of vowels again.

In such manner, all the words that have M, O or D in them can be excluded. Then only word that remains is TIE.
If you are told about T, there are two words OAT and TIE which both have two vowels.
If you are told about I, there are two words AIM and TIE which both have two vowels.
If you are told about E, there are two words DUE and TIE which both have two vowels.

Thus TIE is the code word.