Nice Array Deletions | Dataford Interview Questions

Nice Array: an array where removing exactly one element makes it strictly increasing. Given positive integers, find the number of elements that need to be removed to make it a Nice Array.

Implement min_removals(nums). Return the minimum number of elements that must be removed so the remaining elements are strictly increasing. Return 0 if the array is already strictly increasing.

Input and Output

nums is a list of positive integers. Return an integer.

Constraints

1 <= len(nums) <= 5000
1 <= nums[i] <= 10^9
The remaining elements must preserve their original order
The increasing order is strict, so equal values cannot both remain

Function Signature

def min_removals(nums):

Your question is Nice Array Deletions. 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