Repeat Evolution

2872. Maximum Number of K-Divisible Components

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

2 attempts

342 days apart

0 line delta

8 best lines

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

hard

Solution 8 lines

Thoughts 0 lines

compact kotlin stuck

Max connected components divisible by k in graph

Full post LeetCode

Attempt 2 · 28.11.2025

hard

Solution 8 lines

Thoughts 1 lines

compact kotlin

342 days later lines 0 chars -50 thoughts +1

Max cuts where every subtree sum %k

Full post LeetCode

Compact generated readout from the first and latest attempts.

Solution size steady

0 lines, -50 chars.

Thinking trace expanded

+1 lines between first and latest attempt.

Best snapshot 28.11.2025

8 lines, 319 chars.

Honesty markers comeback

1 stuck attempts, 0 one-liner attempts.