Back

Sunday common C++ interview problem: Strictly increasing array.

Given two arrays of positive integers, determine the lowest number of operations to make the first array strictly increasing (-1 if not possible).

In one operation, you can change one element of the first array to a value from the second array (arr1[i] = arr2[j]).

Solve it yourself: https://compiler-explorer.com/z/fj5jGP7eG
Solution: https://compiler-explorer.com/z/aqf83e1dz