Practice Lemonade Change

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#860

LeetCode Problem

Lemonade Change

Array Greedy

Problem Statement

At a lemonade stand, each lemonade costs $5. Customers are standing in a queue to buy from you and order one at a time (in the order specified by bills). Each customer will only buy one lemonade and pay with either a $5, $10, or $20 bill. You must provide the correct change to each customer so that the net transaction is that the customer pays $5. Note that you do not have any change in hand at first. Given an integer array bills where bills[i] is the bill the ith customer pays, return true if you can provide every customer with the correct change, or false otherwise.

Source: Lemonade Change on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

bills = [5,5,5,10,20]

Output

true

# Example 2

Input

bills = [5,5,10,10,20]

Output

false

Constraints

1 <= bills.length <= 10^5

bills[i] is either 5, 10, or 20.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free