Skip to content

Practice Kth Smallest Amount With Single Denomination Combination

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#3116
LeetCode Problem

Kth Smallest Amount With Single Denomination Combination

Problem Statement

You are given an integer array coins representing coins of different denominations and an integer k. You have an infinite number of coins of each denomination. However, you are not allowed to combine coins of different denominations. Return the kth smallest amount that can be made using these coins.

Source: Kth Smallest Amount With Single Denomination Combination on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
coins = [3,6,9], k = 3
Output
9

# Example 2

Input
coins = [5,2], k = 7
Output
12

Constraints

1 <= coins.length <= 15
1 <= coins[i] <= 25
1 <= k <= 2 * 10^9
coins contains pairwise distinct integers.

Related LeetCode Problems

Practice more problems similar to Kth Smallest Amount With Single Denomination Combination.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.