How should I practice Minimum Coins for a Target?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Paytm onsite interview problems in FastPrep.

Is Minimum Coins for a Target associated with Paytm?

FastPrep tags this as a Paytm onsite interview coding practice problem when the problem catalog has that company and stage context.

Minimum Coins for a Target

Paytm● MediumNEW GRADONSITE INTERVIEW

Learn

Problem statement

Given an integer array coins of positive denominations and a nonnegative integer target, return the minimum number of coins needed to sum exactly to target.

You may use each denomination any number of times. Return -1 when no combination reaches the target. A target of 0 requires 0 coins.

Function

minCoins(coins: int[], target: int) → int

Examples

Example 1

coins = [1,2,5]target = 11return = 3

The target can be formed as 5 + 5 + 1, using three coins, and no two-coin combination reaches 11.

Example 2

coins = [2]target = 3return = -1

No number of coins with denomination 2 can sum to 3.

Example 3

coins = [2,3]target = 0return = 0

The empty selection already has sum 0.

Constraints

1 <= coins.length <= 200
1 <= coins[i] <= 100000
0 <= target <= 100000
Duplicate denominations may appear in coins.

Source note: Author-written prompt excerpt retained for source fidelity.