Repeat Evolution

1339. Maximum Product of Splitted Binary Tree

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

2 attempts

1124 days apart

-11 line delta

7 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 · 10.12.2022

medium

Solution 18 lines

Thoughts 0 lines

standard kotlin

fun maxProduct(root: TreeNode?): Int {

Full post LeetCode

Attempt 2 · 07.01.2026

medium

Solution 7 lines

Thoughts 0 lines

compact kotlin

1124 days later lines -11 chars -458 thoughts 0

Max sumA sumB of a tree split

Full post LeetCode

Compact generated readout from the first and latest attempts.

Solution size compressed

-11 lines, -458 chars.

Thinking trace steady

0 lines between first and latest attempt.

Best snapshot 07.01.2026

7 lines, 208 chars.

Honesty markers 0 stuck

0 stuck attempts, 0 one-liner attempts.