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

Solution: Super Ugly Number

Explore how to find the n-th super ugly number whose prime factors come from a given array. Learn the k-way merge approach paired with a min heap to generate numbers in order without redundancy, optimizing time and space for efficient coding interview problem solving.

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:

  • 1≤1 \leq n ≤105\leq 10^5

  • 1≤1 \leq primes.length ...