3116. Kth Smallest Amount With Single Denomination Combination

LeetCodeArrayMathBinary SearchBit ManipulationCombinatoricsNumber TheoryOpen on judge ↗

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. Example 1: Input: coins = [3,6,9], k = 3 Output: 9 Explanation: The given coins can make th

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI