Longest Monotonic Subarray with One Replacement

The subarray must be contiguous. Distinguish strictly increasing (<) from non-decreasing (<=) before solving each part.

Part 1: Longest Strictly Increasing Run

Problem Statement

Return the length of the longest contiguous strictly increasing subarray....