Solution: Nth Magical Number
Understand how to determine the nth magical number divisible by given integers a or b through an efficient binary search approach. Learn to use the inclusion-exclusion principle to count divisible numbers and implement a solution that handles large values modulo 1,000,000,007.
We'll cover the following...
We'll cover the following...
Statement
Given three integers n, a, and b, return the nth magical number.
A magical number is defined as a positive integer that is divisible by either a or b.
As the result may be very large, return it modulo
Constraints:
n...