Solution: Super Ugly Number
Let’s solve the Super Ugly Number problem using the K-Way Merge pattern.
We'll cover the following...
Statement
Given an integer n
and an array of distinct prime numbers primes
, return the n
-th super ugly number. A super ugly number is a positive integer whose only prime factors are from a given array primes
.
The n
-th super ugly number is guaranteed to fit within a 32-bit signed integer.
Constraints:
n
primes.length
...