Repeat Evolution

1971. Find if Path Exists in Graph

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

2 attempts

489 days apart

-16 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 · 19.12.2022

easy

Solution 22 lines

Thoughts 0 lines

standard kotlin

fun validPath(n: Int, edges: Array, source: Int, destination: Int): Boolean {

Full post LeetCode

Attempt 2 · 21.04.2024

easy

Solution 6 lines

Thoughts 0 lines

tiny kotlin

489 days later lines -16 chars -269 thoughts 0

Are source and destination connected in graph?

Full post LeetCode

Compact generated readout from the first and latest attempts.

Solution size compressed

-16 lines, -269 chars.

Thinking trace steady

0 lines between first and latest attempt.

Best snapshot 21.04.2024

6 lines, 289 chars.

Honesty markers 0 stuck

0 stuck attempts, 0 one-liner attempts.