Repeat Evolution
3105. Longest Strictly Increasing or Strictly Decreasing Subarray
2 attempts over 647 days. This page compares how the solution size, thinking trace, and stuck markers changed between posts.
Timeline Shape
Bars are normalized inside this problem, so the widest bar is the largest attempt in that metric.
Attempt Gallery
Each card is a daily post, with local deltas from the previous attempt.
Attempt 1 · 03.02.2025
easy3105. Longest Strictly Increasing or Strictly Decreasing Subarray
tiny
rust
Longest strict monotonic subarray
Attempt 2 · 12.11.2026
easy3105. Longest Strictly Increasing or Strictly Decreasing Subarray
one-liner
kotlin
647 days later
lines -2
chars -36
thoughts 0
Max strictly monotonic subarray size
What Changed
Compact generated readout from the first and latest attempts.
-2 lines, -36 chars.
0 lines between first and latest attempt.
2 lines, 129 chars.
0 stuck attempts, 1 one-liner attempts.