Repeat Evolution

1137. N-th Tribonacci Number

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

2 attempts

450 days apart

-6 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 · 30.01.2023

easy

Solution 12 lines

Thoughts 0 lines

compact kotlin

another way is to use dp cache

Full post LeetCode

Attempt 2 · 24.04.2024

easy

Solution 6 lines

Thoughts 0 lines

tiny kotlin

450 days later lines -6 chars -16 thoughts 0

nth Tribonacci number f(n + 3) = f(n) + f(n + 1) + f(n + 2)

Full post LeetCode

Compact generated readout from the first and latest attempts.

Solution size compressed

-6 lines, -16 chars.

Thinking trace steady

0 lines between first and latest attempt.

Best snapshot 24.04.2024

6 lines, 130 chars.

Honesty markers 0 stuck

0 stuck attempts, 0 one-liner attempts.