Leetcode 2263. Make Array Non-decreasing or Non-increasing

Given an integer array, determine the minimum work (removals/changes/operations as defined) required to make the array monotonic either non-decreasing or non-increasing; the solution requires designing an optimal strategy (often via dynamic programming, longest monotone subsequence variants, or advanced greedy/DP with constraints) to choose which elements to keep or transform under tight limits.