Repeat Evolution

983. Minimum Cost For Tickets

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

2 attempts

644 days apart

-7 line delta

9 best lines

10 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 · 28.03.2023

medium

Solution 16 lines

Thoughts 0 lines

standard kotlin

Let's write DFS with memoization algorithm as it is simple to understand.

Full post LeetCode

Attempt 2 · 31.12.2024

medium

Solution 9 lines

Thoughts 10 lines

compact kotlin

644 days later lines -7 chars -284 thoughts +10

Min sum buying 1,7,30-days tickets to travel all days programming

Full post LeetCode

Compact generated readout from the first and latest attempts.

Solution size compressed

-7 lines, -284 chars.

Thinking trace expanded

+10 lines between first and latest attempt.

Best snapshot 31.12.2024

9 lines, 308 chars.

Honesty markers 0 stuck

0 stuck attempts, 0 one-liner attempts.