Leetcode Problem 2289. Steps to Make Array Non-decreasing

2289. Steps to Make Array Non-decreasing

Leetcode Solutions

Initialize an empty stack to store pairs of elements and their corresponding steps.
Initialize a variable res to keep track of the maximum number of steps.
Iterate through the array in reverse. a. For each element, initialize a variable dp_i to 0. b. While the stack is not empty and the current element is greater than the element at the top of the stack: i. Update dp_i to be the maximum of dp_i + 1 and the steps of the element at the top of the stack. ii. Pop the element from the stack. c. Update res to be the maximum of res and dp_i. d. Push the current element and its steps onto the stack.
Return res as the final result.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen