Design and Analysis of Algorithms (CS3230) - National University of Singapore
-
Updated
Nov 6, 2017 - Java
Design and Analysis of Algorithms (CS3230) - National University of Singapore
Coin Change Problem (Total number of ways to make change) Implementation
Solves and prints the cache to the console the classic dynamic programming coin change problem (min coin and max combinations).
coin dispenser machine, returning the optimal result in O(numberOfCoins * targetValue)
In this project are implemented algorithms for the solution of the MST, Stable Marriage and Coin Change problems.
Dynamic programming solution to the "Perfect Squares" problem on LeetCode.
Add a description, image, and links to the coin-change topic page so that developers can more easily learn about it.
To associate your repository with the coin-change topic, visit your repo's landing page and select "manage topics."