Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2584. Split the Array to Make Coprime Products
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.