# Algorithmic Toolbox | Week 3

Course Name: Algorithmic Toolbox

#### Programming Assignment 3: Greedy Algorithms

3-1: Money Change

def get_min_coins(money):
# Define the denominations
denominations = [10, 5, 1]
num_coins = 0

# Iterate over each denomination
for coin in denominations:
if money == 0:
break
num_coins += money // coin
money %= coin

return num_coins

if __name__ == '__main__':
money = int(input().strip())
print(get_min_coins(money))

These are Algorithmic Toolbox Week 3 Programming Assignment Coursera Answers

3-2: Maximum Value of the Loot (Fractional Knapsack)

These are Algorithmic Toolbox Week 3 Programming Assignment Coursera Answers

3-3: Car Fueling

These are Algorithmic Toolbox Week 3 Programming Assignment Coursera Answers

These are Algorithmic Toolbox Week 3 Programming Assignment Coursera Answers

3-5: Collecting Signatures (Covering Segments by Points)

These are Algorithmic Toolbox Week 3 Programming Assignment Coursera Answers

3-6: Maximum Number of Prizes (Different Summands)

These are Algorithmic Toolbox Week 3 Programming Assignment Coursera Answers

3-7: Maximum Salary (Largest Number)