Leetcode 3326. Minimum Division Operations to Make Array Non Decreasing

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3326. Minimum Division Operations to Make Array Non Decreasing

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact