Repeat Evolution
787. Cheapest Flights Within K Stops
2 attempts over 393 days. This page compares how the solution size, thinking trace, and stuck markers changed between posts.
Timeline Shape
Bars are normalized inside this problem, so the widest bar is the largest attempt in that metric.
Attempt Gallery
Each card is a daily post, with local deltas from the previous attempt.
Attempt 1 · 26.01.2023
medium787. Cheapest Flights Within K Stops
standard
kotlin
by the problem definition, path length is k+1, not just k
Attempt 2 · 23.02.2024
medium787. Cheapest Flights Within K Stops
compact
kotlin
393 days later
lines -3
chars -92
thoughts 0
Cheapest travel src -> dst with at most k stops in a directed weighted graph.
What Changed
Compact generated readout from the first and latest attempts.
-3 lines, -92 chars.
0 lines between first and latest attempt.
10 lines, 319 chars.
0 stuck attempts, 0 one-liner attempts.