Repeat Evolution

2492. Minimum Score of a Path Between Two Cities

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

2 attempts

1200 days apart

-12 line delta

6 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 · 22.03.2023

medium

Solution 18 lines

Thoughts 0 lines

standard kotlin

Connect all roads and update minimums in the Union-Find data structure. Use simple arrays for both connections and minimums.

Full post LeetCode

Attempt 2 · 04.07.2026

medium

Solution 6 lines

Thoughts 0 lines

tiny kotlin

1200 days later lines -12 chars -247 thoughts 0

Min in connected edges

Full post LeetCode

Compact generated readout from the first and latest attempts.

Solution size compressed

-12 lines, -247 chars.

Thinking trace steady

0 lines between first and latest attempt.

Best snapshot 04.07.2026

6 lines, 224 chars.

Honesty markers 0 stuck

0 stuck attempts, 0 one-liner attempts.