A queue of people are waiting to buy ice cream from you.
Each person buys one ice cream, which sells for $5.
Each customer is holding a bill of $5, $10 or $20.
Your initial balance is 0.
Find whether you will be able to make change for every customer in the queue. You must serve customers in the order they come in.
For example
5, 5, 5, 10, 20 -> true,
5, 5, 10 -> true,
10, 10 -> false
boolean sellIceCream(int[] bills)
{
int[] a = new int[2];
for(int m : bills){
if(m == 5) {
a[0]++;
}
else if(m == 10){
if( a[0] < 1) {
return false;
}
a[0]--;
a[1]--;
}
else if(m == 20){
if(a[1] > 0){
a[1]--;
if(a[0] > 0) {
a[0]--;
}
else {
return false;
}
}else{
if(a[0] > 3) {
a[0] -= 3;
}
else {
return false;
}
}
}
}
return true;
}
Get one-to-one training from Google Facebook engineers
Top-notch Professionals
Learn from Facebook and Google senior engineers interviewed 100+ candidates.
Most recent interview questions and system design topics gathered from aonecode alumnus.
One-to-one online classes. Get feedbacks from real interviewers.
Customized Private Class
Already a coding expert? - Advance straight to hard interview topics of your interest.
New to the ground? - Develop basic coding skills with your own designated mentor.
Days before interview? - Focus on most important problems in target company question bank.