other solution

2.py

# A Dynamic Programming based Python3 program to 
# find minimum of coins to make a given change V 
import sys 

# m is size of coins array (number of 
# different coins) 
def minCoins(coins, V): 
    
    # table[i] will be storing the minimum 
    # number of coins required for i value. 
    # So table[V] will have result 
    table = [sys.maxsize for i in range(V + 1)] 

    # Base case (If given value V is 0) 
    table[0] = 0

    # Compute minimum coins required 
    # for all values from 1 to V 
    speed_count = 0
    for value in range(1, V + 1): 
        speed_count +=1
        # Go through all coins smaller than value
        for coin in coins: # take first element 1
            if (coin <= value):  #if 1 <= 1
                sub_res = table[value - coin] #sub_res = table[1-1]
                if (sub_res != sys.maxsize and sub_res + 1 < table[value]): #1 (sub_res is 0 + 1) < 0 (table[value] is 0)
                    table[value] = sub_res + 1 # table[value] = 1
            speed_count +=1
    print("other_speed_count", speed_count)
    return table[V]

# Driver Code 
if __name__ == "__main__": 

    coin_list = [1,4,5]
    target = 12

    print("Minimum coins required is ", 
                minCoins(coin_list, target)) 

# This code is contributed by ita_c