Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
29 changes: 29 additions & 0 deletions Dynamic Programming/mincoin.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,29 @@
import sys

def min_coins(coins,sum):

# dp[i] will be storing the minimum
dp = [0 for i in range(sum + 1)]

# Base case
dp[0] = 0

# Initialize values as Infinite
for i in range(1, sum + 1):
dp[i] = sys.maxsize

# for all values from 1 to sum
for i in range(1, sum + 1):
for j in range(len(coins)):
if (coins[j] <= i):
res = dp[i - coins[j]]
if (res != sys.maxsize and res + 1 < dp[i]):
dp[i] = res + 1
return dp[sum]


if __name__ == "__main__":
coins = [9, 6, 5, 1]
m = len(coins)
amount = 11
print("Minimum coins:",min_coins(coins,amount))
1 change: 1 addition & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -74,6 +74,7 @@ Pune, Maharashtra, India.<br />
* [Fibonacci Series](Dynamic%20Programming/P01_Fibonnaci.py)
* [Longest Increasing Subsequence](Dynamic%20Programming/P02_LongestIncreasingSubsequence.py)
* [Longest Continuous Odd Subsequence](Dynamic%20Programming/P03_LongestContinuousOddSubsequence.py)
* [Count Minimum Number of Coins](Dynamic%20Programming/mincoin.py)

# Donation

Expand Down