I only had one phone interview.

Then I was invited to the headquarters for onsite interviews.

The problems were not hard. They consisted of algorithm and data structure problems, and one mathematics problem.

There are three coke machines. Each one has two values: min and max. This means if you get coke from a machine, it will load you a random volume in the range [min, max]. Given a cup size n and a minimum soda volume m, show if it's possible to make it from these machines.