LeetCode 1909. Remove One Element to Make the Array Strictly Increasing - Optimal solution by analyzing possible cases and find patterns (Java, O(n))

Problem Description LeetCode 1909: Remove One Element to Make the Array Strictly Increasing Given a 0-indexed integer array nums, return true if it can be made strictly increasing after removing exactly one element, or false otherwise. If the array...