Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.