Solution: Nth Magical Number
Understand how to find the nth magical number divisible by either of two given integers. Explore using the inclusion-exclusion principle and binary search to efficiently solve this mathematical coding problem with modulo constraints.
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...