Make Array Strictly Increasing | Dataford Interview Questions

Strictly Increasing Sequence: given N non-negative integers, you may reduce each element by X (0 <= X <= a[i]) at most once; can the array become strictly increasing?

Asked in the OA stage. For each element, choose its own reduction amount, including zero. Implement can_be_strictly_increasing(a) and return a boolean indicating whether some valid reductions produce a strictly increasing array.

Input and Output

Input is a list a of non-negative integers. Return True or False.

Constraints

1 <= len(a) <= 100000
0 <= a[i] <= 1000000000
Each reduction amount is an integer and may be chosen independently for each element

Function Signature

def can_be_strictly_increasing(a):

Your question is Make Array Strictly Increasing. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem