If EELS + MARK + BEST + WARY = EASY

What does HELP + BARK + WARD + LEAD equal?

They came out at night, without being called.
They lost at day, without being stolen.
Who are they?

Decode the below four famous ciphers:

8P of the SS
1M of the E
1S of the SS
60M in 1H

John was running from 40 thieves. John has got 3 gold boxes which weigh as 4kg, 2kg, and 1kg respectively. A witty man asked John to stay with him for seven days in exchange for 1kg gold per day. John needs to stay there for seven days and also do not want to give the witty man any advance. How can John pay for his seven days stay?

Client Dempsey living in one of the East Coast states of the U.S. was talking to Landon Donovan, who was living in the West Coast state of the U.S.

Dempsey: What time is it?
Donovan: Wow, It is the same time here.

How is this possible?

You are trapped in a room with two doors. One leads to certain death and the other leads to freedom. You don't know which is which.
There are two robots guarding the doors. They will let you choose one door but upon doing so you must go through it.
You can, however, ask one robot one question. The problem is one robot always tells the truth, the other always lies and you don't know which is which.
What is the question you ask?

The barber of Town shaves all men living in the town. No man living in the town is allowed to shave himself. The barber lives in that town. Who then shaves the barber of the town?

Four people need to cross a rickety bridge at night. Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge. Times for each person: 1 min, 2 mins, 7 mins and 10 mins. What is the shortest time needed for all four of them to cross the bridge?

Replace the question mark with the number below given a simple math problem.

I had an infinite supply of water and 5 litres and 3 litres jars.

How would you measure exactly 4 litres in the least number of steps?