Repeat Evolution

2966. Divide Array Into Arrays With Max Difference

2 attempts over 503 days. This page compares how the solution size, thinking trace, and stuck markers changed between posts.

2 attempts

503 days apart

0 line delta

3 best lines

0 thought lines

0 stuck attempts

Repeat lab Latest post Back to library LeetCode

Timeline Shape

Bars are normalized inside this problem, so the widest bar is the largest attempt in that metric.

Each card is a daily post, with local deltas from the previous attempt.

Attempt 1 · 01.02.2024

medium

Solution 3 lines

Thoughts 0 lines

tiny kotlin

Split array into tripples with at most k difference.

Full post LeetCode

Attempt 2 · 18.06.2025

medium

Solution 3 lines

Thoughts 0 lines

tiny kotlin

503 days later lines 0 chars -15 thoughts 0

List of k-narrow tripplets

Full post LeetCode

Compact generated readout from the first and latest attempts.

Solution size steady

0 lines, -15 chars.

Thinking trace steady

0 lines between first and latest attempt.

Best snapshot 18.06.2025

3 lines, 122 chars.

Honesty markers 0 stuck

0 stuck attempts, 0 one-liner attempts.