Available question text
You can replace any composite number by its smallest prime factor (primes and 1 are unchanged) in one operation; find the minimum number of such replacements needed to make the array non-decreasing, or return -1 if it's impossible.
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 3326. Minimum Division Operations to Make Array Non Decreasing
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source