Minimum Division Operations to Make Array Non Decreasing
You are given an integer array nums.
Any positive divisor of a natural number x that is strictly less than x is called a proper divisor of x. For example, 2 is a proper divisor of 4, while 6 is not a proper divisor of 6.
You are allowed to perform an operation any number of times on nums, where in each operation you select any one element from nums and divide it by its greatest proper divisor.
Return the minimum number of operations required to make the array non-decreasing.
If it is not possible to make the array non-decreasing using any number of operations, return -1.
Example 1
Input
nums = [25,7]Output
1Using a single operation, 25 gets divided by 5 and
nums becomes [5, 7].Example 2
Input
nums = [7,7,6]Output
-1No sequence of allowed operations can make
[7, 7, 6] non-decreasing.Constraints
- 1 <= nums.length <= 10^5
- 1 <= nums[i] <= 10^6
Asked at 2 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.