Lemonade Change Problem

Lemonade Change Problem — ExecCode Easy DSA Practice

Solve the Lemonade Change problem on ExecCode. Free online easy DSA practice in Greedy. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given an integer array bills where bills[i] is the bill the i^th customer pays, return true if you can provide every customer with the correct change, or false otherwise. Your task is to 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. Return the required answer exactly as shown in the examples.

Examples

Input bills = [5, 5, 5, 5, 20, 20, 5, 5, 20, 5]; Output false. Input bills = [5, 5, 10, 10, 5, 20]; Output true. Input bills = [5, 5, 5, 5, 5, 5, 10, 10, 10, 20, 20, 20]; Output true

Constraints

1 <= bills.length <= 10^5 bills[i] is either 5, 10, or 20.

Practice Lemonade Change free on ExecCode. Browse DSA problems, topic map, and placement guides.