Sponsored
Watch expert explanations and walkthroughs
Solve with full IDE support and test cases
Tim Huang
Progmatic
Code With K5KC
Code to Success
Encode Decode
LeekCodeDev
Coding streak
hornclause
Coding Blizz
![[ LeetCode ] Longest Strictly Increasing or Strictly Decreasing Subarray | Python](/_next/image?url=https%3A%2F%2Fi.ytimg.com%2Fvi%2F1o5efVzTrrY%2Fhq720.jpg%3Fsqp%3D-oaymwExCNAFEJQDSFryq4qpAyMIARUAAIhCGAHwAQH4Af4JgALQBYoCDAgAEAEYZSBlKGUwDw%3D%3D%26rs%3DAOn4CLCdID_VXY8kEk99wM2vhlNGCq8tNQ&w=256&q=75)
![[February 3, 2025, LeetCode daily] 3105. Longest Strictly Increasing or Strictly Decreasing Subarray](/_next/image?url=https%3A%2F%2Fi.ytimg.com%2Fvi%2FjnXcQB9hueU%2Fhq720.jpg%3Fsqp%3D-oaymwExCNAFEJQDSFryq4qpAyMIARUAAIhCGAHwAQH4Af4JgALQBYoCDAgAEAEYYSBhKGEwDw%3D%3D%26rs%3DAOn4CLCPQ7-tNFy9kZyklnWKMT3tBp4MHg&w=256&q=75)
