Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1201. Ugly Number III
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.