Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in JavaScript

Solution: Nth Magical Number

Explore how to find the nth magical number divisible by either a or b by combining mathematical concepts and binary search. Learn to apply inclusion-exclusion to count valid numbers and perform efficient searches to solve large constraints within code.

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 109+710^9+7.

Constraints:

  • 1≤1 \leq n ≤109\leq 10^9

  • ...