Challenge 1: Counting Money!
Given infinite quarters, dimes, nickels and pennies, calculate the minimum number of coins to represent a number V. Implement the solution in C++ and see if your code runs successfully!
We'll cover the following
Problem Statement:
Given an infinite number of quarters , dimes , nickels , and pennies , implement a function to calculate the number of COINS to represent cents.
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.