Java: Greedy Algorithm to find Minimum number of Coins

Level : Intermediate
Mentor: Shailendra Chauhan
Type : GuidedLab
Points : 10
Duration : 00:30:00

Lab Details

Problem Statement:

Given a value of V Rs and an infinite supply of each of the denominations {1, 2, 5, 10, 20, 50,

100, 500, 1000} valued coins/notes, The task is to find the minimum number of coins and/or

notes needed to make the change?

Example

Input:

V = 70

Output:

2
We need a 50 Rs note and a 20 Rs note.
Self-paced Membership
  • 22+ Video Courses
  • 800+ Hands-On Labs
  • 400+ Quick Notes
  • 55+ Skill Tests
  • 45+ Interview Q&A Courses
  • 10+ Real-world Projects
  • Career Coaching Sessions
  • Email Support
Upto 60% OFF
Know More
Still have some questions? Let's discuss.
CONTACT US
Accept cookies & close this