Available question text
Find the smallest index i where the product of nums[0..i] and nums[i+1..n-1] are coprime — equivalently, where no prime factor appears on both sides. With n up to 10^4 and nums[i] up to 10^6, the core challenge is efficient prime factorization and tracking counts of prime factors across the split to detect the earliest index with zero shared primes.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2584. Split the Array to Make Coprime Products
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source