Lemonade Change

Try to solve the Lemonade Change problem.

Statement

There is a lemonade stand where customers can buy one lemonade at a time for $5\$5 and pay with a $5\$5, $10\$10, or $20\$20 bill. It is necessary to return the correct change to each customer so that the net transaction is completed successfully with a total payment of $5\$5. Note that no change is available initially.

Given an integer array, bills, where bills[i] represents the bill paid by the ithi^{th} customer, return TRUE if it is possible to provide every customer with the correct change, or FALSE otherwise.

Constraints:

  • 1≤1 \leq bills.length ≤500\leq 500

  • bills[i] is either 55, 1010, or 2020.

Examples

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.