Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3105. Longest Strictly Increasing or Strictly Decreasing Subarray
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source