Repeat Evolution

1545. Find Kth Bit in Nth Binary String

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

2 attempts

500 days apart

-6 line delta

4 best lines

57 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.10.2024

medium

Solution 10 lines

Thoughts 35 lines

compact kotlin

kth bit of sequence bs[i] = bs[i-1] + '1' + rev(inv(bs[i-1])) manipulation

Full post LeetCode

Attempt 2 · 03.03.2026

medium

Solution 4 lines

Thoughts 22 lines

tiny rust 120 min

500 days later lines -6 chars -31 thoughts -13

Kth bit in s=s+1+inv(rev(s)) sequence

Full post LeetCode

Compact generated readout from the first and latest attempts.

Solution size compressed

-6 lines, -31 chars.

Thinking trace compressed

-13 lines between first and latest attempt.

Best snapshot 03.03.2026

4 lines, 143 chars.

Honesty markers 0 stuck

0 stuck attempts, 0 one-liner attempts.