Algorithm · Datadog · Medium
You are given an array coins of distinct positive integers representing available coin denominations, and an integer target representing the amount you need to make. You have an unlimited supply of each coin type. Your task is to return an array counts with the same length as coins, where counts[i] indicates how many coins of denomination coins[i] are used in a combination that sums to target using the fewest total coins possible. If the target cannot be formed with the…
Checking your access…