Leetcode 3105. Longest Strictly Increasing or Strictly Decreasing Subarray

Given an integer array, return the length of the longest contiguous subarray that is strictly increasing or strictly decreasing. This is equivalent to finding the longest strictly monotonic run in the array (can be found in a single linear scan).