Repeat Evolution

1026. Maximum Difference Between Node and Ancestor

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

2 attempts

398 days apart

-3 line delta

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

medium

Solution 13 lines

Thoughts 0 lines

standard kotlin

fun maxAncestorDiff(root: TreeNode?): Int {

Full post LeetCode

Attempt 2 · 11.01.2024

medium

Solution 10 lines

Thoughts 0 lines

compact kotlin

398 days later lines -3 chars -218 thoughts 0

Max diff between node and ancestor in a binary tree.

Full post LeetCode

Compact generated readout from the first and latest attempts.

Solution size compressed

-3 lines, -218 chars.

Thinking trace steady

0 lines between first and latest attempt.

Best snapshot 11.01.2024

10 lines, 249 chars.

Honesty markers 0 stuck

0 stuck attempts, 0 one-liner attempts.