Repeat Evolution

1579. Remove Max Number of Edges to Keep Graph Fully Traversable

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

2 attempts

427 days apart

-20 line delta

13 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 · 30.04.2023

hard

Solution 33 lines

Thoughts 0 lines

long kotlin

Use separate Union-Find objects for Alice and for Bob

Full post LeetCode

Attempt 2 · 30.06.2024

medium

Solution 13 lines

Thoughts 0 lines

standard kotlin

427 days later lines -20 chars -247 thoughts 0

Remove extra nodes in a connected graph by type 1, 2 and 3=1+2

Full post LeetCode

Compact generated readout from the first and latest attempts.

Solution size compressed

-20 lines, -247 chars.

Thinking trace steady

0 lines between first and latest attempt.

Best snapshot 30.06.2024

13 lines, 566 chars.

Honesty markers 0 stuck

0 stuck attempts, 0 one-liner attempts.