Given infinite supply of "n" denominations of coins and a change amount "A", give an algorithm to use minimum number of coins to do the transaction?
Posts
1 year ago
Apr 1, 2008
Subscribe to:
Post Comments (Atom)
skip to main |
skip to sidebar
Feel free to contribute, however it will be moderated to curb spams.
Contributors
Labels
- Arrays (12)
- Backtracking (3)
- Bit Twiddling (5)
- Coin Puzzles (2)
- Common Puzzles (2)
- Data Structure (4)
- Dynamic Programming (3)
- Graph Algorithms (6)
- Hashing (1)
- Interview Questions (1)
- J2EE (1)
- Java (5)
- Linked Lists (6)
- LVL:AVG (1)
- Numeric Puzzles (4)
- Programming (1)
- Sorting (2)
- Trees (5)
- Tries (1)
- UNSOLVED (3)
No comments:
Post a Comment