Repeat Evolution

834. Sum of Distances in Tree

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

2 attempts

493 days apart

-15 line delta

14 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.12.2022

hard

Solution 29 lines

Thoughts 0 lines

long kotlin

fun sumOfDistancesInTree(n: Int, edges: Array): IntArray {

Full post LeetCode

Attempt 2 · 28.04.2024

hard

Solution 14 lines

Thoughts 0 lines

standard kotlin

493 days later lines -15 chars -120 thoughts 0

Sums of paths to each leafs in a tree

Full post LeetCode

Compact generated readout from the first and latest attempts.

Solution size compressed

-15 lines, -120 chars.

Thinking trace steady

0 lines between first and latest attempt.

Best snapshot 28.04.2024

14 lines, 540 chars.

Honesty markers 0 stuck

0 stuck attempts, 0 one-liner attempts.