Available question text
Given coin denominations where you may only use multiples of a single denomination, find the k-th smallest distinct amount in the union of those arithmetic sequences of multiples. The core challenge is efficiently counting how many distinct multiples are ≤ x (via LCM/inclusion–exclusion) and using that count to binary-search the k-th value.
Related questions
Continue with questions that share topics or the same question type.
- Find the Kth Smallest Element Across Multiple Sorted Lists
Coding
- Find the Kth Smallest Sum of a Matrix With Sorted Rows
Coding
- Kth Smallest Element in a BST
Coding · Binary Search Tree · Binary Tree · Depth-First Search
- Kth Smallest Element in a Sorted Matrix
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3116. Kth Smallest Amount With Single Denomination Combination
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source