Evan-Kim2028

# This is an O(n^2 * m) runtime, but it can be decreased to O(n*m)
from typing import List

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

def coin_solution_hard(coin_list_start: List[int], target: int) -> int:
    """
    Input: coin_list_start = list of sorted coin values in a List \\

Evan-Kim2028

# 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 

Evan-Kim2028

Evan-Kim2028

Evan-Kim2028

Evan-Kim2028

{
 "cells": [
  {
   "cell_type": "code",
   "execution_count": 16,
   "metadata": {},
   "outputs": [],
   "source": [
    "from subgrounds import Subgrounds\n",

Evan-Kim2028

{
 "cells": [
  {
   "cell_type": "code",
   "execution_count": 1,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",

Evan-Kim2028

Evan-Kim2028

{
 "cells": [
  {
   "cell_type": "code",
   "execution_count": 1,
   "metadata": {},
   "outputs": [],
   "source": [
    "from subgrounds import Subgrounds\n",
    "from subgrounds.schema import TypeRef\n",

Evan-Kim2028