Feb 3

Author: siddydutta

2025-02-February-LeetCoding-Challenge/Longest Strictly Increasing or Strictly Decreasing Subarray.py

@@ -0,0 +1,28 @@
+from itertools import pairwise
+from typing import List
+
+
+class Solution:
+    def longestMonotonicSubarray(self, nums: List[int]) -> int:
+        curr_incr, curr_decr = 1, 1
+        max_len = 1
+        for n1, n2 in pairwise(nums):
+            curr_incr = (n1 < n2) * curr_incr + 1
+            curr_decr = (n1 > n2) * curr_decr + 1
+            max_len = max(max_len, curr_incr, curr_decr)
+        return max_len
+
+
+def main():
+    nums = [1, 4, 3, 3, 2]
+    assert Solution().longestMonotonicSubarray(nums) == 2
+
+    nums = [3, 3, 3, 3]
+    assert Solution().longestMonotonicSubarray(nums) == 1
+
+    nums = [3, 2, 1]
+    assert Solution().longestMonotonicSubarray(nums) == 3
+
+
+if __name__ == '__main__':
+    main()

2025-02-February-LeetCoding-Challenge/README.md

@@ -6,7 +6,7 @@
 | --- | --- | --- | --- |
 | February 01 | [3151. Special Array I](https://leetcode.com/problems/special-array-i/) | Easy | Solved |
 | February 02 | [1752. Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/) | Easy | Solved |
-| February 03 | []() |  |  |
+| February 03 | [3105. Longest Strictly Increasing or Strictly Decreasing Subarray](https://leetcode.com/problems/longest-strictly-increasing-or-strictly-decreasing-subarray/) | Easy | Solved |
 | February 04 | []() |  |  |
 | February 05 | []() |  |  |
 | February 06 | []() |  |  |
@@ -37,6 +37,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 2 | 2 | 0 |
+| Easy   | 3 | 3 | 0 |
 | Medium | 0 | 0 | 0 |
 | Hard   | 0 | 0 | 0 |