Repeat Evolution

368. Largest Divisible Subset

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

2 attempts

422 days apart

-5 line delta

9 best lines

13 thought lines

1 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 · 09.02.2024

medium

Solution 14 lines

Thoughts 0 lines

standard kotlin 60 min stuck almost gave up

Longest subset of divisible by s[i] % s[j] == 0 || s[j] % s[i] == 0.

Full post LeetCode

Attempt 2 · 06.04.2025

medium

Solution 9 lines

Thoughts 13 lines

compact kotlin

422 days later lines -5 chars -30 thoughts +13

Longest all pairs divisible subset

Full post LeetCode

Compact generated readout from the first and latest attempts.

Solution size compressed

-5 lines, -30 chars.

Thinking trace expanded

+13 lines between first and latest attempt.

Best snapshot 06.04.2025

9 lines, 336 chars.

Honesty markers comeback

1 stuck attempts, 0 one-liner attempts.