Available question text
Find the nth positive integer that is divisible by at least one of a, b, or c. Use inclusion–exclusion with lcm(a,b,c) to count how many numbers ≤ x are divisible and binary search over x (needed since n and values can be up to 1e9).
Related questions
Continue with questions that share topics or the same question type.
- Single Number III
Coding
- Strobogrammatic Number III
Coding
- Super Ugly Number
Coding
- Ugly Number
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 1201. Ugly Number III
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source