Longest Strictly Increasing or Strictly Decreasing Subarray
You are given an array of integers nums. Return the length of the longest subarray ofnums which is either strictly increasing or strictly decreasing.
LeetCode Problem - 3105
class Solution {
public int longestMonotonicSubarray(int[] nums) {
...
perfinsights.hashnode.dev2 min read