Tap here to switch tabs
Problem
Submissions

Problem: Kth Smallest Amount With Single Denomination Combos

Kth Smallest Amount With Single Denomination Combos gives an array of distinct coin denominations. Return the kth smallest positive amount that is a multiple of at least one denomination.

Statement

You are given an integer array coins representing available coin denominations and an integer k.

An amount is valid if it can be formed using a single denomination from coins (meaning the amount is a positive integer multiple of at least one element in coins).

Return the kextthk^{ ext{th}} smallest valid amount.

Constraints:

  • 1≤1 \leq coins.length ≤15\leq 15

  • 1≤1 \leq coins[i] ≤25\leq 25

  • 1≤1 \leq k ≤2imes109\leq 2 imes 10^9

  • coins contains pairwise distinct integers.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Kth Smallest Amount With Single Denomination Combos

Kth Smallest Amount With Single Denomination Combos gives an array of distinct coin denominations. Return the kth smallest positive amount that is a multiple of at least one denomination.

Statement

You are given an integer array coins representing available coin denominations and an integer k.

An amount is valid if it can be formed using a single denomination from coins (meaning the amount is a positive integer multiple of at least one element in coins).

Return the kextthk^{ ext{th}} smallest valid amount.

Constraints:

  • 1≤1 \leq coins.length ≤15\leq 15

  • 1≤1 \leq coins[i] ≤25\leq 25

  • 1≤1 \leq k ≤2imes109\leq 2 imes 10^9

  • coins contains pairwise distinct integers.