lots of exercises in java... from https://github.com/exercism/java

Harikrushna Vanpariya 4759dd9be1 forth: update version file (1.4.0 -> 1.5.0) #1377 change: update version file (1.1.0 -> 1.2.0) #1376 list-ops: update version file (2.0.0 -> 2.2.0) #1375 book-store: update version file (1.2.0 -> 1.3.0) #1373 circular-buffer: update version file (1.0.1 -> 1.1.0) #1371 ocr-numbers: update version file (1.0.0 -> 1.1.0) #1370 wordy: update version file (1.0.0 -> 1.1.0) #1362 minesweeper: update version file (1.0.0 -> 1.1.0) #1361		пре 6 година
..
.meta	forth: update version file (1.4.0 -> 1.5.0) #1377	пре 6 година
src	Move test version data to .meta dir	пре 7 година
README.md	Adjust exercise README formatting; drop help link	пре 7 година
build.gradle	Format build.gradle files	пре 7 година

Change

Correctly determine the fewest number of coins to be given to a customer such that the sum of the coins' value would equal the correct amount of change.

For example

An input of 15 with [1, 5, 10, 25, 100] should return one nickel (5) and one dime (10) or [0, 1, 1, 0, 0]
An input of 40 with [1, 5, 10, 25, 100] should return one nickel (5) and one dime (10) and one quarter (25) or [0, 1, 1, 1, 0]

Edge cases

Does your algorithm work for any given set of coins?
Can you ask for negative change?
Can you ask for a change value smaller than the smallest coin value?

Running the tests

You can run all the tests for an exercise by entering

$ gradle test

in your terminal.

Source

Software Craftsmanship - Coin Change Kata https://web.archive.org/web/20130115115225/http://craftsmanship.sv.cmu.edu:80/exercises/coin-change-kata

Submitting Incomplete Solutions

It's possible to submit an incomplete solution so you can see how others have completed the exercise.